./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strspn.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/strspn.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 d2c6859ca90ff0da205f4fa2f88d8f61c0c2d9f9f437471b81ea8abc3f9fd19e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:38:40,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:38:40,822 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:40,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:38:40,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:38:40,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:38:40,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:38:40,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:38:40,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:38:40,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:38:40,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:38:40,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:38:40,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:38:40,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:38:40,852 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:38:40,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:38:40,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:38:40,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:38:40,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:38:40,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:38:40,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:38:40,855 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:38:40,855 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 -> d2c6859ca90ff0da205f4fa2f88d8f61c0c2d9f9f437471b81ea8abc3f9fd19e [2025-03-04 15:38:41,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:38:41,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:38:41,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:38:41,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:38:41,060 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:38:41,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strspn.i [2025-03-04 15:38:42,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146f2b8fd/fff82a39c30148039e0543f9a5b0e3dd/FLAGd67e7d2ab [2025-03-04 15:38:42,438 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:38:42,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strspn.i [2025-03-04 15:38:42,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146f2b8fd/fff82a39c30148039e0543f9a5b0e3dd/FLAGd67e7d2ab [2025-03-04 15:38:42,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146f2b8fd/fff82a39c30148039e0543f9a5b0e3dd [2025-03-04 15:38:42,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:38:42,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:38:42,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:42,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:38:42,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:38:42,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:42" (1/1) ... [2025-03-04 15:38:42,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16088c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:42, skipping insertion in model container [2025-03-04 15:38:42,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:38:42" (1/1) ... [2025-03-04 15:38:42,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:38:42,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:42,697 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:38:42,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:38:42,743 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:38:42,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:42 WrapperNode [2025-03-04 15:38:42,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:38:42,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:42,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:38:42,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:38:42,749 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:42" (1/1) ... [2025-03-04 15:38:42,756 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:42" (1/1) ... [2025-03-04 15:38:42,768 INFO L138 Inliner]: procedures = 113, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-03-04 15:38:42,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:38:42,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:38:42,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:38:42,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:38:42,775 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:42" (1/1) ... [2025-03-04 15:38:42,775 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:42" (1/1) ... [2025-03-04 15:38:42,778 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:42" (1/1) ... [2025-03-04 15:38:42,787 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 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:42,787 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:42" (1/1) ... [2025-03-04 15:38:42,788 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:42" (1/1) ... [2025-03-04 15:38:42,796 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:42" (1/1) ... [2025-03-04 15:38:42,796 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:42" (1/1) ... [2025-03-04 15:38:42,797 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:42" (1/1) ... [2025-03-04 15:38:42,798 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:42" (1/1) ... [2025-03-04 15:38:42,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:38:42,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:38:42,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:38:42,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:38:42,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:42" (1/1) ... [2025-03-04 15:38:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:42,821 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:42,823 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:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:38:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:38:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:38:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:38:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:38:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:38:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:38:42,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:38:42,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:38:42,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:38:43,007 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_#t~ret15#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2025-03-04 15:38:43,015 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 15:38:43,015 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:38:43,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:38:43,020 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:38:43,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:43 BoogieIcfgContainer [2025-03-04 15:38:43,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:38:43,021 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:38:43,021 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:38:43,024 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:38:43,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:43,025 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:38:42" (1/3) ... [2025-03-04 15:38:43,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51952972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:43, skipping insertion in model container [2025-03-04 15:38:43,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:43,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:38:42" (2/3) ... [2025-03-04 15:38:43,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51952972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:38:43, skipping insertion in model container [2025-03-04 15:38:43,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:38:43,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:38:43" (3/3) ... [2025-03-04 15:38:43,029 INFO L363 chiAutomizerObserver]: Analyzing ICFG strspn.i [2025-03-04 15:38:43,058 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:38:43,058 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:38:43,059 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:38:43,059 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:38:43,059 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:38:43,059 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:38:43,059 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:38:43,059 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:38:43,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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:43,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:38:43,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:43,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:43,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:43,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:38:43,075 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:38:43,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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:43,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:38:43,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:43,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:43,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:43,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:38:43,079 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" [2025-03-04 15:38:43,080 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" "assume !true;" "call strspn_#t~mem8#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);" "assume !(0 == strspn_#t~mem8#1);havoc strspn_#t~mem8#1;strspn_#t~post9#1 := strspn_~l~0#1;strspn_~l~0#1 := 1 + strspn_#t~post9#1;strspn_#t~post10#1.base, strspn_#t~post10#1.offset := strspn_~s#1.base, strspn_~s#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#t~post10#1.base, 1 + strspn_#t~post10#1.offset;havoc strspn_#t~post10#1.base, strspn_#t~post10#1.offset;" [2025-03-04 15:38:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2030715, now seen corresponding path program 1 times [2025-03-04 15:38:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066422525] [2025-03-04 15:38:43,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:43,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash 50543153, now seen corresponding path program 1 times [2025-03-04 15:38:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555367264] [2025-03-04 15:38:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:38:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:38:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:43,230 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:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555367264] [2025-03-04 15:38:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555367264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:38:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79972930] [2025-03-04 15:38:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:43,235 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:38:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:43,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:38:43,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:38:43,255 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:43,259 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-04 15:38:43,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2025-03-04 15:38:43,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:38:43,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 13 transitions. [2025-03-04 15:38:43,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:38:43,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:38:43,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-03-04 15:38:43,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:43,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-04 15:38:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-03-04 15:38:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-04 15:38:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-04 15:38:43,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-04 15:38:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:38:43,283 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-04 15:38:43,283 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:38:43,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-03-04 15:38:43,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:38:43,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:43,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:43,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:43,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:43,284 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" [2025-03-04 15:38:43,284 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume !strspn_#t~short6#1;" "assume !strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;" "call strspn_#t~mem8#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);" "assume !(0 == strspn_#t~mem8#1);havoc strspn_#t~mem8#1;strspn_#t~post9#1 := strspn_~l~0#1;strspn_~l~0#1 := 1 + strspn_#t~post9#1;strspn_#t~post10#1.base, strspn_#t~post10#1.offset := strspn_~s#1.base, strspn_~s#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#t~post10#1.base, 1 + strspn_#t~post10#1.offset;havoc strspn_#t~post10#1.base, strspn_#t~post10#1.offset;" [2025-03-04 15:38:43,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2030715, now seen corresponding path program 2 times [2025-03-04 15:38:43,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930325088] [2025-03-04 15:38:43,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,303 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:43,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:43,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:43,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:43,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1326589165, now seen corresponding path program 1 times [2025-03-04 15:38:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682466395] [2025-03-04 15:38:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:43,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:43,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:43,418 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:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682466395] [2025-03-04 15:38:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682466395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:43,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:38:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733206457] [2025-03-04 15:38:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:43,419 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:38:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:38:43,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:38:43,419 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:43,450 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-03-04 15:38:43,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-03-04 15:38:43,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:43,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 14 transitions. [2025-03-04 15:38:43,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:38:43,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:38:43,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-03-04 15:38:43,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:43,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-04 15:38:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-03-04 15:38:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:38:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-04 15:38:43,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-04 15:38:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:38:43,455 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-04 15:38:43,455 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:38:43,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-03-04 15:38:43,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:38:43,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:43,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:43,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:38:43,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:43,457 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" [2025-03-04 15:38:43,458 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume strspn_#t~short6#1;call strspn_#t~mem3#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);call strspn_#t~mem4#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := strspn_#t~mem3#1 != strspn_#t~mem4#1;" "assume !strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;" "call strspn_#t~mem8#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);" "assume !(0 == strspn_#t~mem8#1);havoc strspn_#t~mem8#1;strspn_#t~post9#1 := strspn_~l~0#1;strspn_~l~0#1 := 1 + strspn_#t~post9#1;strspn_#t~post10#1.base, strspn_#t~post10#1.offset := strspn_~s#1.base, strspn_~s#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#t~post10#1.base, 1 + strspn_#t~post10#1.offset;havoc strspn_#t~post10#1.base, strspn_#t~post10#1.offset;" [2025-03-04 15:38:43,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2030715, now seen corresponding path program 3 times [2025-03-04 15:38:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901027840] [2025-03-04 15:38:43,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:38:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:43,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:38:43,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:43,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:43,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:43,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:43,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1326559374, now seen corresponding path program 1 times [2025-03-04 15:38:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117952082] [2025-03-04 15:38:43,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:43,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:43,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:43,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:43,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1162963244, now seen corresponding path program 1 times [2025-03-04 15:38:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641481939] [2025-03-04 15:38:43,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:43,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:38:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:38:43,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:38:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:38:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:43,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:44,277 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:44,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:44,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:44,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:44,278 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:44,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:44,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:44,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration3_Lasso [2025-03-04 15:38:44,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:44,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:44,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:44,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:44,808 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:38:44,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:44,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,831 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:38:44,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,836 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:38:44,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:44,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,846 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:44,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:38:44,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:38:44,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:44,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:38:44,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:44,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:38:44,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:44,965 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:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:44,967 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:44,968 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:44,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:44,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:44,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:44,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:44,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:44,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:44,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:44,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:45,014 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:38:45,016 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:38:45,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:45,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:45,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:38:45,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:45,033 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:45,033 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:45,034 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1) = -1*ULTIMATE.start_strspn_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1 Supporting invariants [] [2025-03-04 15:38:45,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:45,065 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:38:45,070 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:45,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:45,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-04 15:38:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:38:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:38:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:45,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:45,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:45,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:38:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:38:45,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:45,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:45,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:45,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:45,199 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:45,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:45,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 20 states and 25 transitions. Complement of second has 5 states. [2025-03-04 15:38:45,250 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:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-04 15:38:45,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2025-03-04 15:38:45,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-04 15:38:45,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-04 15:38:45,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:45,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-03-04 15:38:45,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:38:45,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 23 transitions. [2025-03-04 15:38:45,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:38:45,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:38:45,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-03-04 15:38:45,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:45,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-04 15:38:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-03-04 15:38:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-04 15:38:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-04 15:38:45,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-04 15:38:45,275 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-04 15:38:45,275 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:38:45,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-03-04 15:38:45,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:45,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:45,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:45,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:38:45,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:45,276 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" [2025-03-04 15:38:45,276 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume !strspn_#t~short6#1;" "assume strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;strspn_#t~post7#1.base, strspn_#t~post7#1.offset := strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_#t~post7#1.base, 1 + strspn_#t~post7#1.offset;havoc strspn_#t~post7#1.base, strspn_#t~post7#1.offset;" [2025-03-04 15:38:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1951517850, now seen corresponding path program 1 times [2025-03-04 15:38:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270875723] [2025-03-04 15:38:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,285 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:45,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash 46638, now seen corresponding path program 1 times [2025-03-04 15:38:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521895098] [2025-03-04 15:38:45,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:45,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:45,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:38:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521895098] [2025-03-04 15:38:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521895098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:38:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:38:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:38:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829877279] [2025-03-04 15:38:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:38:45,342 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:38:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:38:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:38:45,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:38:45,343 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:38:45,349 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-03-04 15:38:45,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2025-03-04 15:38:45,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:45,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 19 transitions. [2025-03-04 15:38:45,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:38:45,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:38:45,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2025-03-04 15:38:45,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:45,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-04 15:38:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2025-03-04 15:38:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:38:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-04 15:38:45,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-04 15:38:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:38:45,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-04 15:38:45,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:38:45,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2025-03-04 15:38:45,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:45,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:45,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:45,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:38:45,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:45,355 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" [2025-03-04 15:38:45,355 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume strspn_#t~short6#1;call strspn_#t~mem3#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);call strspn_#t~mem4#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := strspn_#t~mem3#1 != strspn_#t~mem4#1;" "assume strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;strspn_#t~post7#1.base, strspn_#t~post7#1.offset := strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_#t~post7#1.base, 1 + strspn_#t~post7#1.offset;havoc strspn_#t~post7#1.base, strspn_#t~post7#1.offset;" [2025-03-04 15:38:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1951517850, now seen corresponding path program 2 times [2025-03-04 15:38:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603339655] [2025-03-04 15:38:45,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:45,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:45,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:45,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 46607, now seen corresponding path program 1 times [2025-03-04 15:38:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863887973] [2025-03-04 15:38:45,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:45,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:45,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:45,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:45,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 990967510, now seen corresponding path program 1 times [2025-03-04 15:38:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:45,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055010326] [2025-03-04 15:38:45,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:45,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:45,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:45,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:38:45,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:38:45,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:45,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:45,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:45,983 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:45,983 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:45,983 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:45,983 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:45,983 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:45,984 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:45,984 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:45,984 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:45,984 INFO L132 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration5_Lasso [2025-03-04 15:38:45,984 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:45,984 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:45,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:45,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:46,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:46,445 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,447 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:46,448 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:46,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,468 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:46,469 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:46,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:46,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:46,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,490 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:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:38:46,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:46,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:38:46,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:38:46,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:38:46,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:46,511 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:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:38:46,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:46,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:46,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:46,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:46,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:46,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:46,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:46,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:46,550 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-04 15:38:46,551 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:38:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:46,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:46,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:38:46,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:46,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:46,566 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:46,566 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14#1.base)_2, ULTIMATE.start_strspn_~a~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14#1.base)_2 - 1*ULTIMATE.start_strspn_~a~0#1.offset Supporting invariants [] [2025-03-04 15:38:46,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:46,590 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:38:46,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:46,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:46,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-04 15:38:46,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:38:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:38:46,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:46,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:38:46,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:46,640 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:46,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:46,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:46,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:46,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:38:46,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:46,689 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:46,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 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:46,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. 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 31 states and 36 transitions. Complement of second has 6 states. [2025-03-04 15:38:46,719 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:46,719 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:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-04 15:38:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-04 15:38:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 15:38:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-04 15:38:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:46,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-04 15:38:46,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:46,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 26 transitions. [2025-03-04 15:38:46,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:38:46,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:38:46,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2025-03-04 15:38:46,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:38:46,721 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 15:38:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2025-03-04 15:38:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-04 15:38:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:38:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 15:38:46,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 15:38:46,722 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 15:38:46,722 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:38:46,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2025-03-04 15:38:46,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:38:46,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:38:46,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:38:46,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:38:46,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:38:46,722 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~ret15#1, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet11#1;main_~in_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#1(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet13#1;main_~out_len~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s#1.base, strspn_#in~s#1.offset, strspn_#in~accept#1.base, strspn_#in~accept#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strspn_#res#1;havoc strspn_#t~mem2#1, strspn_#t~mem5#1, strspn_#t~mem3#1, strspn_#t~mem4#1, strspn_#t~short6#1, strspn_#t~post7#1.base, strspn_#t~post7#1.offset, strspn_#t~mem8#1, strspn_#t~post9#1, strspn_#t~post10#1.base, strspn_#t~post10#1.offset, strspn_~s#1.base, strspn_~s#1.offset, strspn_~accept#1.base, strspn_~accept#1.offset, strspn_~l~0#1, strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#in~s#1.base, strspn_#in~s#1.offset;strspn_~accept#1.base, strspn_~accept#1.offset := strspn_#in~accept#1.base, strspn_#in~accept#1.offset;strspn_~l~0#1 := 0;havoc strspn_~a~0#1.base, strspn_~a~0#1.offset;" "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume strspn_#t~short6#1;call strspn_#t~mem3#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);call strspn_#t~mem4#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := strspn_#t~mem3#1 != strspn_#t~mem4#1;" "assume !strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;" "call strspn_#t~mem8#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);" "assume !(0 == strspn_#t~mem8#1);havoc strspn_#t~mem8#1;strspn_#t~post9#1 := strspn_~l~0#1;strspn_~l~0#1 := 1 + strspn_#t~post9#1;strspn_#t~post10#1.base, strspn_#t~post10#1.offset := strspn_~s#1.base, strspn_~s#1.offset;strspn_~s#1.base, strspn_~s#1.offset := strspn_#t~post10#1.base, 1 + strspn_#t~post10#1.offset;havoc strspn_#t~post10#1.base, strspn_#t~post10#1.offset;" "assume true;call strspn_#t~mem2#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);" "assume 0 != strspn_#t~mem2#1;havoc strspn_#t~mem2#1;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_~accept#1.base, strspn_~accept#1.offset;" [2025-03-04 15:38:46,722 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strspn_#t~mem5#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := 0 != strspn_#t~mem5#1;" "assume strspn_#t~short6#1;call strspn_#t~mem3#1 := read~int#1(strspn_~s#1.base, strspn_~s#1.offset, 1);call strspn_#t~mem4#1 := read~int#0(strspn_~a~0#1.base, strspn_~a~0#1.offset, 1);strspn_#t~short6#1 := strspn_#t~mem3#1 != strspn_#t~mem4#1;" "assume strspn_#t~short6#1;havoc strspn_#t~mem5#1;havoc strspn_#t~mem3#1;havoc strspn_#t~mem4#1;havoc strspn_#t~short6#1;strspn_#t~post7#1.base, strspn_#t~post7#1.offset := strspn_~a~0#1.base, strspn_~a~0#1.offset;strspn_~a~0#1.base, strspn_~a~0#1.offset := strspn_#t~post7#1.base, 1 + strspn_#t~post7#1.offset;havoc strspn_#t~post7#1.base, strspn_#t~post7#1.offset;" [2025-03-04 15:38:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -916179789, now seen corresponding path program 2 times [2025-03-04 15:38:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410599817] [2025-03-04 15:38:46,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:38:46,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:46,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:38:46,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:46,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:46,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 46607, now seen corresponding path program 2 times [2025-03-04 15:38:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598598611] [2025-03-04 15:38:46,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:38:46,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:46,761 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:46,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:38:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:46,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 605088797, now seen corresponding path program 1 times [2025-03-04 15:38:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:38:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185924902] [2025-03-04 15:38:46,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:38:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:38:46,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:38:46,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:38:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:38:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:38:46,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:38:46,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:46,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:38:46,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:38:47,544 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:38:47,544 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:38:47,544 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:38:47,544 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:38:47,544 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:38:47,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:47,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:38:47,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:38:47,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration6_Lasso [2025-03-04 15:38:47,544 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:38:47,544 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:38:47,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:47,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:38:48,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:38:48,060 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:38:48,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,063 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:48,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:38:48,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:38:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,085 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:48,085 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:48,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,096 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-03-04 15:38:48,096 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-04 15:38:48,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,115 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2025-03-04 15:38:48,115 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-04 15:38:48,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:38:48,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,163 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:48,164 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:48,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:38:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,189 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:48,190 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:48,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,212 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:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,215 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:48,217 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:48,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,241 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:48,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,243 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:38:48,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:38:48,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:38:48,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:38:48,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,274 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:48,276 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:48,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:38:48,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:38:48,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:38:48,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:38:48,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:38:48,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:38:48,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:38:48,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:38:48,307 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:38:48,307 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:38:48,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:38:48,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:38:48,309 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:48,310 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:48,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:38:48,321 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:38:48,321 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:38:48,321 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0#1.base)_2, ULTIMATE.start_strspn_~a~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0#1.base)_2 - 1*ULTIMATE.start_strspn_~a~0#1.offset Supporting invariants [] [2025-03-04 15:38:48,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:38:48,351 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2025-03-04 15:38:48,353 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:38:48,353 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:38:48,353 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-04 15:38:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:48,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:48,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:48,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:48,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:48,421 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:48,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 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:48,438 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 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 28 states and 31 transitions. Complement of second has 5 states. [2025-03-04 15:38:48,439 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:48,440 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:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-04 15:38:48,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:38:48,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,440 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:38:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:48,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:48,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:48,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:48,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:48,502 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:48,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 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:48,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 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 28 states and 31 transitions. Complement of second has 5 states. [2025-03-04 15:38:48,517 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:48,517 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:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-04 15:38:48,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:38:48,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,518 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:38:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:38:48,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:38:48,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:38:48,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:38:48,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:38:48,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:38:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:38:48,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:38:48,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:38:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:38:48,584 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:48,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 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:48,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 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 32 states and 37 transitions. Complement of second has 4 states. [2025-03-04 15:38:48,603 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:48,603 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:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-04 15:38:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:38:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-04 15:38:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-04 15:38:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:38:48,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2025-03-04 15:38:48,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:38:48,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:38:48,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:38:48,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:38:48,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:38:48,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:38:48,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:38:48,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:38:48,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:38:48 BoogieIcfgContainer [2025-03-04 15:38:48,616 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:38:48,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:38:48,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:38:48,617 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:38:48,617 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:43" (3/4) ... [2025-03-04 15:38:48,619 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:38:48,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:38:48,620 INFO L158 Benchmark]: Toolchain (without parser) took 6159.65ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.1MB in the beginning and 57.5MB in the end (delta: 64.5MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2025-03-04 15:38:48,620 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:48,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.28ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 105.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:38:48,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.92ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:48,620 INFO L158 Benchmark]: Boogie Preprocessor took 28.62ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:48,620 INFO L158 Benchmark]: IcfgBuilder took 221.38ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 89.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:38:48,621 INFO L158 Benchmark]: BuchiAutomizer took 5595.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 88.8MB in the beginning and 57.6MB in the end (delta: 31.2MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-03-04 15:38:48,621 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 201.3MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:38:48,622 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.14ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.28ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 105.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.92ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 104.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.62ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 221.38ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 89.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 5595.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 88.8MB in the beginning and 57.6MB in the end (delta: 31.2MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 201.3MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 50.8kB). 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: ~a~0!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: ~a~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 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 4 locations. One nondeterministic module has affine ranking function null and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 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, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 83 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax100 hnf100 lsp96 ukn70 mio100 lsp26 div100 bol100 ite100 ukn100 eq156 hnf90 smp100 dnf128 smp100 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 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:48,634 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:48,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE