./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 961e7f6fbd61acd9d4f1771460dcf26fd486b3de35e5e0e3ca8e6e03bda0fabc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:02:37,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:02:37,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:02:37,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:02:37,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:02:37,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:02:37,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:02:37,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:02:37,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:02:37,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:02:37,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:02:37,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:02:37,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:02:37,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:02:37,321 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:02:37,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:02:37,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:02:37,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:02:37,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:02:37,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:02:37,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:02:37,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:02:37,323 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:02:37,323 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961e7f6fbd61acd9d4f1771460dcf26fd486b3de35e5e0e3ca8e6e03bda0fabc [2025-03-17 20:02:37,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:02:37,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:02:37,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:02:37,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:02:37,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:02:37,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2025-03-17 20:02:38,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286e7e2c/db1a78966d234a90a3af8eece0ee2ab6/FLAG75b1b4ce3 [2025-03-17 20:02:38,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:02:38,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2025-03-17 20:02:38,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286e7e2c/db1a78966d234a90a3af8eece0ee2ab6/FLAG75b1b4ce3 [2025-03-17 20:02:39,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286e7e2c/db1a78966d234a90a3af8eece0ee2ab6 [2025-03-17 20:02:39,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:02:39,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:02:39,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:39,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:02:39,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:02:39,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39, skipping insertion in model container [2025-03-17 20:02:39,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:02:39,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:39,481 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:02:39,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:39,536 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:02:39,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39 WrapperNode [2025-03-17 20:02:39,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:39,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:39,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:02:39,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:02:39,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,565 INFO L138 Inliner]: procedures = 117, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-17 20:02:39,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:39,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:02:39,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:02:39,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:02:39,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,589 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-17 20:02:39,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:02:39,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:02:39,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:02:39,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:02:39,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (1/1) ... [2025-03-17 20:02:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:39,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:02:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:02:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:02:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:02:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:02:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:02:39,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:02:39,697 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:02:39,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:02:39,805 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;havoc main_#t~ret12#1;call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; [2025-03-17 20:02:39,811 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 20:02:39,811 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:02:39,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:02:39,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:02:39,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:39 BoogieIcfgContainer [2025-03-17 20:02:39,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:02:39,821 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:02:39,821 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:02:39,825 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:02:39,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:39,825 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:02:39" (1/3) ... [2025-03-17 20:02:39,826 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@205f61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:02:39, skipping insertion in model container [2025-03-17 20:02:39,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:39,826 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:39" (2/3) ... [2025-03-17 20:02:39,826 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@205f61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:02:39, skipping insertion in model container [2025-03-17 20:02:39,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:39,827 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:39" (3/3) ... [2025-03-17 20:02:39,827 INFO L363 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca-2.i [2025-03-17 20:02:39,856 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:02:39,856 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:02:39,856 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:02:39,856 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:02:39,857 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:02:39,857 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:02:39,857 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:02:39,857 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:02:39,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:02:39,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:39,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:39,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:02:39,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:39,872 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:02:39,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:02:39,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:39,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:39,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:02:39,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:39,876 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0;" [2025-03-17 20:02:39,876 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length1~0#1 - 1;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-17 20:02:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 47631, now seen corresponding path program 1 times [2025-03-17 20:02:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554537007] [2025-03-17 20:02:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:39,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-17 20:02:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506966567] [2025-03-17 20:02:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:39,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:39,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:39,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:39,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:40,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times [2025-03-17 20:02:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:40,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-03-17 20:02:40,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:40,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:40,276 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:40,277 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:40,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:40,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:40,277 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:40,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:40,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:40,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration1_Lasso [2025-03-17 20:02:40,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:40,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:40,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,649 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:40,651 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:40,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:40,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:02:40,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:40,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:40,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:40,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:40,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:40,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:40,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:40,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:40,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:40,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 20:02:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:40,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:40,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:02:40,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:40,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:40,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:40,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:40,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:40,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:40,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:40,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:40,712 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-17 20:02:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:40,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:40,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:02:40,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:40,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:40,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:40,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:40,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:40,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:40,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:40,747 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:40,788 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:40,790 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:02:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:40,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:02:40,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:40,809 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:40,810 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:40,810 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length1~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length1~0#1 Supporting invariants [] [2025-03-17 20:02:40,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:40,826 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 20:02:40,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:40,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:40,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:40,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:40,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:40,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:40,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:40,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:40,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:02:40,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:40,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 20 transitions. Complement of second has 3 states. [2025-03-17 20:02:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-17 20:02:40,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 20:02:40,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:40,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 20:02:40,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:40,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 20:02:40,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:40,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2025-03-17 20:02:40,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:40,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 14 transitions. [2025-03-17 20:02:40,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:02:40,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:02:40,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-17 20:02:40,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:40,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:02:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-17 20:02:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-17 20:02:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-17 20:02:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-17 20:02:40,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 20:02:40,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 20:02:40,946 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:02:40,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-17 20:02:40,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:40,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:40,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:40,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:02:40,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:40,947 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem2#1, cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0;" [2025-03-17 20:02:40,947 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrreplace_#t~mem2#1 := read~int#0(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume 0 != cstrreplace_#t~mem2#1;havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int#0(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int#0(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1;" "cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset;" [2025-03-17 20:02:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1476574, now seen corresponding path program 1 times [2025-03-17 20:02:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751825254] [2025-03-17 20:02:40,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:40,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1260991, now seen corresponding path program 1 times [2025-03-17 20:02:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225114586] [2025-03-17 20:02:40,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:40,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:40,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:40,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:40,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2142801692, now seen corresponding path program 1 times [2025-03-17 20:02:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-17 20:02:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:41,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:41,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:41,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:41,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:02:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-17 20:02:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:41,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:02:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733759736] [2025-03-17 20:02:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:41,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:02:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:02:41,370 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:41,402 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2025-03-17 20:02:41,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-03-17 20:02:41,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:41,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 12 transitions. [2025-03-17 20:02:41,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:02:41,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 20:02:41,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-17 20:02:41,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:41,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 20:02:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-17 20:02:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 20:02:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-17 20:02:41,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 20:02:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:02:41,406 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 20:02:41,406 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:02:41,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-17 20:02:41,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:41,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:41,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:41,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:41,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:41,406 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1 - 1;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem2#1, cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0;" [2025-03-17 20:02:41,407 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrreplace_#t~mem2#1 := read~int#0(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume 0 != cstrreplace_#t~mem2#1;havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int#0(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int#0(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1;" "cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset;" [2025-03-17 20:02:41,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 45773838, now seen corresponding path program 1 times [2025-03-17 20:02:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:41,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337293593] [2025-03-17 20:02:41,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:41,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:41,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:41,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:41,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:41,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1260991, now seen corresponding path program 2 times [2025-03-17 20:02:41,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:41,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-17 20:02:41,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:41,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:41,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:41,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:41,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:41,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:41,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:41,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2032853836, now seen corresponding path program 1 times [2025-03-17 20:02:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:41,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-03-17 20:02:41,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:41,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:41,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:41,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:41,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:41,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:41,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:41,832 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:41,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:41,833 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:41,833 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:41,833 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:41,833 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,833 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:41,833 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:41,833 INFO L132 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration3_Lasso [2025-03-17 20:02:41,833 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:41,833 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:41,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,184 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:42,185 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:02:42,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,206 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-17 20:02:42,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:02:42,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:02:42,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:02:42,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:02:42,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:02:42,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:02:42,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:02:42,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,289 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-17 20:02:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,290 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:02:42,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 20:02:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:02:42,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:42,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:42,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 20:02:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,334 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:02:42,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:42,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:42,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:42,365 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:02:42,366 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:02:42,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,368 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:02:42,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:42,379 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:42,380 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:42,380 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrreplace_~p~0#1.base)_1, ULTIMATE.start_cstrreplace_~p~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrreplace_~p~0#1.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0#1.offset Supporting invariants [] [2025-03-17 20:02:42,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:02:42,395 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:02:42,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!offset [2025-03-17 20:02:42,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:42,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:42,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:42,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:42,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:42,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:42,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:42,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:42,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:42,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:02:42,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:42,454 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:02:42,454 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:42,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 18 transitions. Complement of second has 4 states. [2025-03-17 20:02:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-17 20:02:42,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:02:42,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:42,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 20:02:42,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:42,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-17 20:02:42,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:42,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-03-17 20:02:42,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:02:42,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2025-03-17 20:02:42,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:02:42,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:02:42,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:02:42,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:42,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:42,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:42,473 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:42,473 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:02:42,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:02:42,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:02:42,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:02:42,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:02:42 BoogieIcfgContainer [2025-03-17 20:02:42,481 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:02:42,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:02:42,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:02:42,481 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:02:42,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:39" (3/4) ... [2025-03-17 20:02:42,484 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:02:42,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:02:42,485 INFO L158 Benchmark]: Toolchain (without parser) took 3239.72ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 50.3MB in the end (delta: 59.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-03-17 20:02:42,485 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:42,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.77ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 93.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:02:42,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.29ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:42,487 INFO L158 Benchmark]: Boogie Preprocessor took 31.57ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:02:42,488 INFO L158 Benchmark]: IcfgBuilder took 221.59ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 77.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:02:42,489 INFO L158 Benchmark]: BuchiAutomizer took 2659.83ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 50.3MB in the end (delta: 27.2MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2025-03-17 20:02:42,490 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 142.6MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:42,490 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.77ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 93.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.29ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.57ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 221.59ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 77.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2659.83ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 50.3MB in the end (delta: 27.2MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 142.6MB. Free memory is still 50.3MB. 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: ~p~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 18 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax115 hnf100 lsp94 ukn68 mio100 lsp44 div138 bol100 ite100 ukn100 eq169 hnf91 smp85 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:02:42,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:02:42,702 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