./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/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-?-798a7b3-m [2025-03-04 15:38:29,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:38:29,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:38:29,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:38:29,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:38:29,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:38:29,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:38:29,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:38:29,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:38:29,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:38:29,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:38:29,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:38:29,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:38:29,307 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:38:29,307 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:38:29,307 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:38:29,308 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:38:29,308 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:38:29,308 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:38:29,308 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:38:29,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:38:29,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:38:29,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:38:29,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:38:29,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:38:29,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:38:29,310 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:38:29,310 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-04 15:38:29,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:38:29,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:38:29,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:38:29,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:38:29,529 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:38:29,531 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-04 15:38:30,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd51f736/e27dc09458184740889a2d5e6ecff26c/FLAG203d5fd92 [2025-03-04 15:38:30,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:38:30,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-03-04 15:38:30,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd51f736/e27dc09458184740889a2d5e6ecff26c/FLAG203d5fd92 [2025-03-04 15:38:31,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd51f736/e27dc09458184740889a2d5e6ecff26c [2025-03-04 15:38:31,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:38:31,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:38:31,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:31,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:38:31,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:38:31,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad73c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31, skipping insertion in model container [2025-03-04 15:38:31,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:38:31,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:31,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:38:31,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:31,456 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:38:31,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31 WrapperNode [2025-03-04 15:38:31,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:31,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:31,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:38:31,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:38:31,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,478 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-04 15:38:31,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:31,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:38:31,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:38:31,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:38:31,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,499 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-04 15:38:31,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:38:31,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:38:31,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:38:31,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:38:31,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (1/1) ... [2025-03-04 15:38:31,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:31,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:31,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:38:31,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:38:31,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:38:31,614 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:38:31,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:38:31,721 INFO L1325 $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-04 15:38:31,727 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-04 15:38:31,728 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:38:31,733 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:38:31,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:38:31,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:31 BoogieIcfgContainer [2025-03-04 15:38:31,734 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:38:31,734 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:38:31,734 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:38:31,738 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:38:31,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:31,739 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:38:31" (1/3) ... [2025-03-04 15:38:31,740 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c928476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:31, skipping insertion in model container [2025-03-04 15:38:31,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:31,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:31" (2/3) ... [2025-03-04 15:38:31,740 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c928476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:31, skipping insertion in model container [2025-03-04 15:38:31,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:31,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:31" (3/3) ... [2025-03-04 15:38:31,741 INFO L363 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2025-03-04 15:38:31,773 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:38:31,774 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:38:31,774 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:38:31,774 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:38:31,774 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:38:31,774 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:38:31,774 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:38:31,774 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:38:31,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:31,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:38:31,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:31,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:31,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:31,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:38:31,791 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:38:31,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:31,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:38:31,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:31,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:31,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:31,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:38:31,796 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#1(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#0(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-04 15:38:31,797 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#1(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-04 15:38:31,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 1 times [2025-03-04 15:38:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845384746] [2025-03-04 15:38:31,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:31,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:31,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:31,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:31,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:31,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:31,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:31,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1599637, now seen corresponding path program 1 times [2025-03-04 15:38:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479208831] [2025-03-04 15:38:31,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:31,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:31,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:31,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:31,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479208831] [2025-03-04 15:38:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479208831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:31,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:38:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54490562] [2025-03-04 15:38:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:31,961 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:38:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:31,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:38:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:38:31,982 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:31,985 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2025-03-04 15:38:31,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-03-04 15:38:31,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:38:31,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 11 transitions. [2025-03-04 15:38:31,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:38:31,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:38:31,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-04 15:38:31,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:31,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:38:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-04 15:38:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:38:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-04 15:38:32,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:38:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:38:32,010 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:38:32,010 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:38:32,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-03-04 15:38:32,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:38:32,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:32,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:32,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:32,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:38:32,011 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#1(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#0(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-04 15:38:32,011 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#1(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#0(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-04 15:38:32,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 2 times [2025-03-04 15:38:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:32,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182253893] [2025-03-04 15:38:32,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:32,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:32,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:32,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:32,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:32,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:32,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 49588040, now seen corresponding path program 1 times [2025-03-04 15:38:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790647301] [2025-03-04 15:38:32,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:32,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:32,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:32,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 138524494, now seen corresponding path program 1 times [2025-03-04 15:38:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:32,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339804921] [2025-03-04 15:38:32,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:32,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:32,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:32,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:32,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:32,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:32,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:32,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:32,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:32,761 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:32,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:32,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:32,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:32,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:32,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:32,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:32,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:32,763 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2025-03-04 15:38:32,763 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:32,763 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:32,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:32,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:32,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:32,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:33,294 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:33,297 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:33,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:38:33,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:33,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:33,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:33,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:33,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:33,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:33,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:33,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:33,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:33,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:38:33,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:33,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:33,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:33,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:33,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:33,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:33,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:33,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:33,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:33,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:38:33,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:38:33,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:33,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:33,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:33,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:33,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:33,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:33,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:33,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:33,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:33,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:38:33,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:38:33,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:33,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:33,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:33,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:33,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:33,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:33,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:33,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:33,408 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-04 15:38:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:38:33,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-04 15:38:33,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:33,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:33,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:33,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:33,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:33,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:33,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:33,455 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:38:33,457 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:38:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:33,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:33,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:38:33,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:33,475 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:33,475 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:33,476 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1, ULTIMATE.start_strcspn_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1 - 1*ULTIMATE.start_strcspn_~s#1.offset Supporting invariants [] [2025-03-04 15:38:33,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:33,503 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:38:33,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:33,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:33,509 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-04 15:38:33,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:33,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:33,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:33,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:33,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:33,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:33,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:33,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:33,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:33,625 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-04 15:38:33,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:33,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 19 transitions. Complement of second has 5 states. [2025-03-04 15:38:33,678 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-04 15:38:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:38:33,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-04 15:38:33,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:33,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-04 15:38:33,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:33,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-04 15:38:33,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:33,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2025-03-04 15:38:33,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:33,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 18 transitions. [2025-03-04 15:38:33,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:38:33,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:38:33,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2025-03-04 15:38:33,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:33,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 15:38:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2025-03-04 15:38:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 15:38:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-04 15:38:33,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 15:38:33,706 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 15:38:33,706 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:38:33,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2025-03-04 15:38:33,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:33,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:33,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:33,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:38:33,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:33,706 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#1(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#0(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#1(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-04 15:38:33,706 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(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#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(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-04 15:38:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1921934394, now seen corresponding path program 1 times [2025-03-04 15:38:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713365758] [2025-03-04 15:38:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:33,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:38:33,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:33,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:33,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:33,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 1 times [2025-03-04 15:38:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304509203] [2025-03-04 15:38:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:33,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:33,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:33,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:33,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:33,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:33,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 138524530, now seen corresponding path program 1 times [2025-03-04 15:38:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528140209] [2025-03-04 15:38:33,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:33,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:33,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:33,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:33,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:33,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:33,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:33,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:33,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:34,324 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:34,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:34,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:34,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:34,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:34,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:34,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:34,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2025-03-04 15:38:34,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:34,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:34,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:34,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:34,787 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:34,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:38:34,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:38:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:38:34,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:38:34,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:38:34,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:38:34,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:38:34,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,878 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-04 15:38:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:38:34,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:38:34,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:38:34,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:34,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:34,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:34,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,919 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:38:34,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-04 15:38:34,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:34,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:34,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:34,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:34,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:34,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:34,951 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:34,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:38:34,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:34,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:34,963 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 15:38:34,963 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-04 15:38:34,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:34,982 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-03-04 15:38:34,982 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-04 15:38:35,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:35,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:35,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:35,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:35,021 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:35,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:38:35,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:35,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:35,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:35,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:35,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:35,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:35,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:35,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:35,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:35,049 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:38:35,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:35,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:35,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:35,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:35,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:35,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:35,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:35,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:35,092 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:38:35,092 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 15:38:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:35,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:35,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:38:35,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:35,109 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:35,109 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:35,109 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2, ULTIMATE.start_strcspn_~reject#1.offset, ULTIMATE.start_strcspn_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2 - 1*ULTIMATE.start_strcspn_~reject#1.offset - 1*ULTIMATE.start_strcspn_~i~0#1 Supporting invariants [] [2025-03-04 15:38:35,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:35,136 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:38:35,138 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:35,138 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:35,138 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-03-04 15:38:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:35,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:35,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:35,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:35,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:35,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:35,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:35,198 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-04 15:38:35,198 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:35,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 42 transitions. Complement of second has 5 states. [2025-03-04 15:38:35,223 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-04 15:38:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:38:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-04 15:38:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 15:38:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-04 15:38:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:35,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2025-03-04 15:38:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:35,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2025-03-04 15:38:35,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:38:35,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:38:35,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-04 15:38:35,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:35,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-04 15:38:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-04 15:38:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-03-04 15:38:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 15:38:35,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 15:38:35,227 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 15:38:35,227 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:38:35,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2025-03-04 15:38:35,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:35,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:35,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:35,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:35,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:35,228 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#1(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#0(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#1(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#0(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#1(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-04 15:38:35,228 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(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#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(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-04 15:38:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -21946739, now seen corresponding path program 2 times [2025-03-04 15:38:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227176492] [2025-03-04 15:38:35,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:38:35,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:38:35,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:38:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:35,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:38:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:38:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:35,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 2 times [2025-03-04 15:38:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652610386] [2025-03-04 15:38:35,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:35,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:35,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:35,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:35,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:35,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:35,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:35,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -980256705, now seen corresponding path program 1 times [2025-03-04 15:38:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129248092] [2025-03-04 15:38:35,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:35,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:35,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:35,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:35,517 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-04 15:38:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129248092] [2025-03-04 15:38:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129248092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:38:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022999445] [2025-03-04 15:38:35,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:38:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:35,520 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-04 15:38:35,522 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-04 15:38:35,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:35,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:35,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:38:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:35,632 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-04 15:38:35,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:38:35,686 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:38:35,688 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-04 15:38:35,691 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-04 15:38:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022999445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:38:35,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:38:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-04 15:38:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020215658] [2025-03-04 15:38:35,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:38:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:35,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:38:35,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:38:35,745 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 6 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:35,830 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 15:38:35,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2025-03-04 15:38:35,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:35,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 32 transitions. [2025-03-04 15:38:35,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:38:35,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:38:35,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2025-03-04 15:38:35,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:35,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-04 15:38:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2025-03-04 15:38:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-04 15:38:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-04 15:38:35,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 15:38:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:38:35,834 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 15:38:35,834 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:38:35,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-03-04 15:38:35,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:35,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:35,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:35,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:35,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:35,835 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#1(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#0(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#1(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#0(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#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(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#0(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#1(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-04 15:38:35,835 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(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#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(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-04 15:38:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 44633685, now seen corresponding path program 2 times [2025-03-04 15:38:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972200208] [2025-03-04 15:38:35,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:38:35,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:35,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:38:35,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:35,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:35,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:35,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:35,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 3 times [2025-03-04 15:38:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967542617] [2025-03-04 15:38:35,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:38:35,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:35,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:35,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:38:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:35,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1757736073, now seen corresponding path program 3 times [2025-03-04 15:38:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979990080] [2025-03-04 15:38:35,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:38:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:35,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-03-04 15:38:35,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:38:35,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:38:35,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:38:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:38:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:35,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:35,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:36,589 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:36,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:36,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:36,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:36,589 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:36,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:36,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:36,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:36,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2025-03-04 15:38:36,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:36,589 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:36,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:36,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:37,297 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:37,297 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:37,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:38:37,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:37,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:37,312 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2025-03-04 15:38:37,313 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-04 15:38:37,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:37,362 INFO L401 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2025-03-04 15:38:37,362 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-04 15:38:37,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:37,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:38:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,458 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:38:37,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:37,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:37,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:37,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:37,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:37,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:37,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:37,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:37,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:38:37,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,487 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:38:37,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:37,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:37,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:37,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:37,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:37,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:37,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:37,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:37,510 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-04 15:38:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,512 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:38:37,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:37,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:37,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:37,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:37,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:37,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:37,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:37,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:37,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,544 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:38:37,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:37,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:37,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:37,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:37,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:37,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:37,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:37,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:37,583 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:38:37,583 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:38:37,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:37,585 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:37,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:38:37,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:37,597 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:37,597 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:37,597 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0#1, v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_3, ULTIMATE.start_strcspn_~reject#1.offset) = -1*ULTIMATE.start_strcspn_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_3 - 1*ULTIMATE.start_strcspn_~reject#1.offset Supporting invariants [] [2025-03-04 15:38:37,603 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-04 15:38:37,623 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 15:38:37,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:37,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:37,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-03-04 15:38:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:37,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:37,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:37,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:37,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:37,680 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-04 15:38:37,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 39 transitions. Complement of second has 5 states. [2025-03-04 15:38:37,699 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-04 15:38:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:38:37,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:38:37,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:37,700 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:38:37,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:37,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:37,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:37,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:37,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:37,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:37,772 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:38:37,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 39 transitions. Complement of second has 5 states. [2025-03-04 15:38:37,789 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-04 15:38:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:38:37,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:38:37,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:37,790 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:38:37,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:37,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:38:37,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:38:37,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:37,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:37,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:37,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:37,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:38:37,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:37,846 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:38:37,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 43 transitions. Complement of second has 4 states. [2025-03-04 15:38:37,865 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-04 15:38:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2025-03-04 15:38:37,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:38:37,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:37,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 15:38:37,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:37,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 15:38:37,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:37,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-03-04 15:38:37,868 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:38:37,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:38:37,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:38:37,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:37,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:38:37,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:38:37,868 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:38:37,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:38:37,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:38:37 BoogieIcfgContainer [2025-03-04 15:38:37,875 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:38:37,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:38:37,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:38:37,876 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:38:37,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:31" (3/4) ... [2025-03-04 15:38:37,877 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:38:37,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:38:37,878 INFO L158 Benchmark]: Toolchain (without parser) took 6682.01ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.0MB in the beginning and 193.3MB in the end (delta: -88.3MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2025-03-04 15:38:37,878 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:37,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.09ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 88.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:38:37,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.83ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.6MB in the end (delta: 985.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:37,879 INFO L158 Benchmark]: Boogie Preprocessor took 32.48ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:37,879 INFO L158 Benchmark]: IcfgBuilder took 222.06ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 72.8MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:38:37,879 INFO L158 Benchmark]: BuchiAutomizer took 6140.69ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 72.8MB in the beginning and 193.4MB in the end (delta: -120.6MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-03-04 15:38:37,879 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 318.8MB. Free memory was 193.4MB in the beginning and 193.3MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:37,880 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.23ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.09ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 88.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.83ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.6MB in the end (delta: 985.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.48ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.06ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 72.8MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6140.69ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 72.8MB in the beginning and 193.4MB in the end (delta: -120.6MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 318.8MB. Free memory was 193.4MB in the beginning and 193.3MB in the end (delta: 63.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] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~reject!offset - 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: ~reject!offset * 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 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 3 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.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 75 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 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: 151ms 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-04 15:38:37,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:38:38,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 15:38:38,295 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