./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1e18bedecf24ed576ef48e748b4e5069642018f9f385da730f53731c063f81f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:58:50,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:58:50,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:58:50,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:58:50,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:58:50,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:58:50,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:58:50,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:58:50,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:58:50,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:58:50,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:58:50,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:58:50,122 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:58:50,122 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:58:50,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:58:50,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:58:50,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:58:50,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:58:50,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:58:50,124 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:58:50,124 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e18bedecf24ed576ef48e748b4e5069642018f9f385da730f53731c063f81f6 [2025-03-17 19:58:50,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:58:50,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:58:50,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:58:50,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:58:50,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:58:50,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i [2025-03-17 19:58:51,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e89b315/9e77f6e5ac07491a9767113f7b29ef7f/FLAG16a670d2d [2025-03-17 19:58:51,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:58:51,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_diffterm_alloca.i [2025-03-17 19:58:51,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e89b315/9e77f6e5ac07491a9767113f7b29ef7f/FLAG16a670d2d [2025-03-17 19:58:51,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e89b315/9e77f6e5ac07491a9767113f7b29ef7f [2025-03-17 19:58:51,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:58:51,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:58:51,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:58:51,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:58:51,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:58:51,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:58:51" (1/1) ... [2025-03-17 19:58:51,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458529a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:51, skipping insertion in model container [2025-03-17 19:58:51,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:58:51" (1/1) ... [2025-03-17 19:58:51,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:58:52,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:58:52,093 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:58:52,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:58:52,157 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:58:52,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52 WrapperNode [2025-03-17 19:58:52,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:58:52,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:58:52,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:58:52,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:58:52,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,192 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-03-17 19:58:52,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:58:52,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:58:52,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:58:52,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:58:52,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,215 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-17 19:58:52,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:58:52,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:58:52,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:58:52,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:58:52,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (1/1) ... [2025-03-17 19:58:52,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:52,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:52,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:58:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:58:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:58:52,333 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:58:52,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:58:52,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L388: havoc main_#t~ret217#1;call ULTIMATE.dealloc(main_#t~malloc215#1.base, main_#t~malloc215#1.offset);havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call ULTIMATE.dealloc(main_#t~malloc216#1.base, main_#t~malloc216#1.offset);havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset; [2025-03-17 19:58:52,488 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 19:58:52,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:58:52,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:58:52,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:58:52,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:58:52 BoogieIcfgContainer [2025-03-17 19:58:52,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:58:52,494 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:58:52,494 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:58:52,502 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:58:52,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:52,503 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:58:51" (1/3) ... [2025-03-17 19:58:52,503 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16a971fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:58:52, skipping insertion in model container [2025-03-17 19:58:52,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:52,504 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:52" (2/3) ... [2025-03-17 19:58:52,505 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16a971fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:58:52, skipping insertion in model container [2025-03-17 19:58:52,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:52,505 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:58:52" (3/3) ... [2025-03-17 19:58:52,506 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrcmp_diffterm_alloca.i [2025-03-17 19:58:52,543 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:58:52,544 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:58:52,544 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:58:52,544 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:58:52,544 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:58:52,544 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:58:52,545 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:58:52,545 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:58:52,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:52,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:52,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:52,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:52,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:58:52,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:58:52,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:58:52,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:52,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:52,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:52,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:52,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:58:52,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:58:52,569 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~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume main_~length1~0#1 < 1;main_~length1~0#1 := 1;" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#1(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~mem205#1, cstrcmp_#t~mem206#1, cstrcmp_#t~mem207#1, cstrcmp_#t~short208#1, cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset, cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset, cstrcmp_#t~mem211#1, cstrcmp_#t~mem212#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1;" [2025-03-17 19:58:52,569 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcmp_#t~mem205#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short208#1 := 49 != cstrcmp_#t~mem205#1;" "assume cstrcmp_#t~short208#1;call cstrcmp_#t~mem206#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem207#1 := read~int#0(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short208#1 := cstrcmp_#t~mem206#1 == cstrcmp_#t~mem207#1;" "assume cstrcmp_#t~short208#1;havoc cstrcmp_#t~mem205#1;havoc cstrcmp_#t~mem206#1;havoc cstrcmp_#t~mem207#1;havoc cstrcmp_#t~short208#1;cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post209#1.base, 1 + cstrcmp_#t~post209#1.offset;havoc cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset;cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post210#1.base, 1 + cstrcmp_#t~post210#1.offset;havoc cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset;" [2025-03-17 19:58:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1444829, now seen corresponding path program 1 times [2025-03-17 19:58:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555729495] [2025-03-17 19:58:52,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:52,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:52,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:52,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:52,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:52,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:52,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 1 times [2025-03-17 19:58:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81662446] [2025-03-17 19:58:52,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:52,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:52,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:52,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:52,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:52,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:52,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:52,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:52,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash 93237644, now seen corresponding path program 1 times [2025-03-17 19:58:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113294203] [2025-03-17 19:58:52,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:52,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:52,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:52,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:52,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113294203] [2025-03-17 19:58:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113294203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:58:53,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:58:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:58:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947767] [2025-03-17 19:58:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:58:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:53,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:58:53,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:58:53,341 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:53,391 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-03-17 19:58:53,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-17 19:58:53,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:53,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 7 states and 9 transitions. [2025-03-17 19:58:53,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:58:53,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:58:53,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2025-03-17 19:58:53,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:58:53,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 19:58:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2025-03-17 19:58:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 19:58:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 19:58:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-17 19:58:53,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 19:58:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:58:53,418 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 19:58:53,418 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:58:53,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2025-03-17 19:58:53,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:53,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:53,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:53,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:58:53,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:58:53,419 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~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#1(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~mem205#1, cstrcmp_#t~mem206#1, cstrcmp_#t~mem207#1, cstrcmp_#t~short208#1, cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset, cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset, cstrcmp_#t~mem211#1, cstrcmp_#t~mem212#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1;" [2025-03-17 19:58:53,419 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcmp_#t~mem205#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short208#1 := 49 != cstrcmp_#t~mem205#1;" "assume cstrcmp_#t~short208#1;call cstrcmp_#t~mem206#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem207#1 := read~int#0(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short208#1 := cstrcmp_#t~mem206#1 == cstrcmp_#t~mem207#1;" "assume cstrcmp_#t~short208#1;havoc cstrcmp_#t~mem205#1;havoc cstrcmp_#t~mem206#1;havoc cstrcmp_#t~mem207#1;havoc cstrcmp_#t~short208#1;cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post209#1.base, 1 + cstrcmp_#t~post209#1.offset;havoc cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset;cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post210#1.base, 1 + cstrcmp_#t~post210#1.offset;havoc cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset;" [2025-03-17 19:58:53,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1445790, now seen corresponding path program 1 times [2025-03-17 19:58:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293619140] [2025-03-17 19:58:53,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:53,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:53,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:53,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 2 times [2025-03-17 19:58:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:53,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094077095] [2025-03-17 19:58:53,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:53,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:53,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:53,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:53,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:53,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:53,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:53,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash 121866795, now seen corresponding path program 1 times [2025-03-17 19:58:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530520296] [2025-03-17 19:58:53,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:53,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:53,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:53,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:53,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:53,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:54,082 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:54,083 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:54,083 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:54,083 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:54,083 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:54,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:54,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:54,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:54,083 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcmp_diffterm_alloca.i_Iteration2_Lasso [2025-03-17 19:58:54,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:54,083 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:54,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:54,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:54,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:54,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:54,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:58:54,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:54,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:54,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:54,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:54,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:54,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:54,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:54,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:54,713 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:58:54,714 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 19:58:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:54,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:54,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:58:54,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:54,735 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:58:54,736 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:54,736 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_1, ULTIMATE.start_cstrcmp_~s2#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_1 - 1*ULTIMATE.start_cstrcmp_~s2#1.offset Supporting invariants [] [2025-03-17 19:58:54,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:58:54,774 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:58:54,779 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:58:54,780 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:58:54,781 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s2!offset [2025-03-17 19:58:54,801 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 19:58:54,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:54,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:58:54,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:54,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:54,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:54,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:54,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:54,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:58:54,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:54,885 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:58:54,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:54,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 20 transitions. Complement of second has 6 states. [2025-03-17 19:58:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-17 19:58:54,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-17 19:58:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:54,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-17 19:58:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:54,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:58:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:54,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-17 19:58:54,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:54,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 18 transitions. [2025-03-17 19:58:54,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:54,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:58:54,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-17 19:58:54,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:54,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 19:58:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-17 19:58:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 19:58:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-17 19:58:54,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:58:54,950 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:58:54,950 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:58:54,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-17 19:58:54,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:58:54,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:54,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:54,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:58:54,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:58:54,951 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~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#1(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~mem205#1, cstrcmp_#t~mem206#1, cstrcmp_#t~mem207#1, cstrcmp_#t~short208#1, cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset, cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset, cstrcmp_#t~mem211#1, cstrcmp_#t~mem212#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1;" "assume true;call cstrcmp_#t~mem205#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short208#1 := 49 != cstrcmp_#t~mem205#1;" [2025-03-17 19:58:54,951 INFO L754 eck$LassoCheckResult]: Loop: "assume !cstrcmp_#t~short208#1;" "assume cstrcmp_#t~short208#1;havoc cstrcmp_#t~mem205#1;havoc cstrcmp_#t~mem206#1;havoc cstrcmp_#t~mem207#1;havoc cstrcmp_#t~short208#1;cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post209#1.base, 1 + cstrcmp_#t~post209#1.offset;havoc cstrcmp_#t~post209#1.base, cstrcmp_#t~post209#1.offset;cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post210#1.base, 1 + cstrcmp_#t~post210#1.offset;havoc cstrcmp_#t~post210#1.base, cstrcmp_#t~post210#1.offset;" "assume true;call cstrcmp_#t~mem205#1 := read~int#1(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short208#1 := 49 != cstrcmp_#t~mem205#1;" [2025-03-17 19:58:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 44819500, now seen corresponding path program 1 times [2025-03-17 19:58:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783348183] [2025-03-17 19:58:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:54,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:54,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:54,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:54,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:54,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:54,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:54,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:54,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:54,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 38667, now seen corresponding path program 1 times [2025-03-17 19:58:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103587689] [2025-03-17 19:58:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:54,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:54,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103587689] [2025-03-17 19:58:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103587689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:58:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:58:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:58:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696532936] [2025-03-17 19:58:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:58:54,993 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:58:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:54,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:58:54,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:58:54,994 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:55,004 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-03-17 19:58:55,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-03-17 19:58:55,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:58:55,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2025-03-17 19:58:55,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:58:55,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:58:55,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:58:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:58:55,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:58:55,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:58:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:58:55,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:58:55,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:58:55,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:58:55,006 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:58:55,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:58:55,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:58:55 BoogieIcfgContainer [2025-03-17 19:58:55,014 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:58:55,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:58:55,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:58:55,014 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:58:55,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:58:52" (3/4) ... [2025-03-17 19:58:55,016 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:58:55,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:58:55,017 INFO L158 Benchmark]: Toolchain (without parser) took 3167.31ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 111.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.85ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 103.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: Boogie Preprocessor took 30.63ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: IcfgBuilder took 269.44ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 86.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: BuchiAutomizer took 2519.46ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 111.3MB in the end (delta: -24.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:58:55,018 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 111.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:58:55,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.85ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 103.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.63ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 269.44ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 86.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2519.46ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 111.3MB in the end (delta: -24.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 111.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s2!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 31 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital218 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp27 div100 bol100 ite100 ukn100 eq150 hnf92 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 80ms VariablesStem: 4 VariablesLoop: 5 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 19:58:55,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE