./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:40:40,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:40:40,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:40:40,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:40:40,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:40:40,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:40:40,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:40:40,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:40:40,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:40:40,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:40:40,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:40:40,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:40:40,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:40:40,930 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:40:40,930 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:40:40,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:40:40,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:40:40,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:40:40,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:40:40,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:40:40,933 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:40:40,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:40:40,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:40:40,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:40:40,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:40:40,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:40:40,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:40:40,934 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:40:40,935 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-jdk21/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 -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f [2025-02-08 14:40:41,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:40:41,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:40:41,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:40:41,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:40:41,251 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:40:41,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_2.c [2025-02-08 14:40:42,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57119ef2f/1d6911c6ccb54b6890f8477ddb5ce464/FLAGe3c1aba50 [2025-02-08 14:40:42,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:40:42,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2025-02-08 14:40:42,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57119ef2f/1d6911c6ccb54b6890f8477ddb5ce464/FLAGe3c1aba50 [2025-02-08 14:40:42,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57119ef2f/1d6911c6ccb54b6890f8477ddb5ce464 [2025-02-08 14:40:42,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:40:42,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:40:42,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:42,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:40:42,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:40:42,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:42" (1/1) ... [2025-02-08 14:40:42,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df8f7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:42, skipping insertion in model container [2025-02-08 14:40:42,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:42" (1/1) ... [2025-02-08 14:40:42,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:40:43,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:43,022 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:40:43,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:43,048 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:40:43,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43 WrapperNode [2025-02-08 14:40:43,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:43,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:43,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:40:43,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:40:43,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,074 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2025-02-08 14:40:43,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:43,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:40:43,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:40:43,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:40:43,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,092 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:40:43,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:40:43,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:40:43,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:40:43,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:40:43,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (1/1) ... [2025-02-08 14:40:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:43,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:43,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:40:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:40:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:40:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:40:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:40:43,227 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:40:43,229 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:40:43,339 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-08 14:40:43,340 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:40:43,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:40:43,349 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:40:43,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:43 BoogieIcfgContainer [2025-02-08 14:40:43,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:40:43,351 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:40:43,351 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:40:43,356 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:40:43,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:43,357 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:40:42" (1/3) ... [2025-02-08 14:40:43,358 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d53d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:43, skipping insertion in model container [2025-02-08 14:40:43,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:43,359 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:43" (2/3) ... [2025-02-08 14:40:43,360 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d53d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:43, skipping insertion in model container [2025-02-08 14:40:43,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:43,360 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:43" (3/3) ... [2025-02-08 14:40:43,361 INFO L363 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2025-02-08 14:40:43,414 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:40:43,414 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:40:43,414 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:40:43,414 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:40:43,415 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:40:43,415 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:40:43,415 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:40:43,415 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:40:43,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.5) 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-02-08 14:40:43,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:40:43,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:43,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:43,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:43,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:40:43,434 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:40:43,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.5) 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-02-08 14:40:43,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:40:43,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:43,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:43,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:43,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:40:43,445 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-02-08 14:40:43,446 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-02-08 14:40:43,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 38, now seen corresponding path program 1 times [2025-02-08 14:40:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465971217] [2025-02-08 14:40:43,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:43,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:43,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-02-08 14:40:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659229724] [2025-02-08 14:40:43,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:43,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:43,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:43,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659229724] [2025-02-08 14:40:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659229724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:40:43,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:40:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:40:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126450740] [2025-02-08 14:40:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:40:43,619 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:43,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:40:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:40:43,646 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.5) 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 14:40:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:43,670 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-02-08 14:40:43,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-02-08 14:40:43,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:43,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 4 states and 5 transitions. [2025-02-08 14:40:43,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-08 14:40:43,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-08 14:40:43,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. [2025-02-08 14:40:43,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:43,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-02-08 14:40:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. [2025-02-08 14:40:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2025-02-08 14:40:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-02-08 14:40:43,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-02-08 14:40:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:40:43,707 INFO L432 stractBuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-02-08 14:40:43,707 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:40:43,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. [2025-02-08 14:40:43,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:40:43,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:43,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:43,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:43,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:40:43,711 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-02-08 14:40:43,711 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-02-08 14:40:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 38, now seen corresponding path program 2 times [2025-02-08 14:40:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659457380] [2025-02-08 14:40:43,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 34723, now seen corresponding path program 1 times [2025-02-08 14:40:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272015363] [2025-02-08 14:40:43,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:43,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:43,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272015363] [2025-02-08 14:40:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272015363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412864933] [2025-02-08 14:40:43,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:43,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:43,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:43,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:40:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:43,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:43,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:40:43,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:43,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412864933] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:43,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 14:40:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464817189] [2025-02-08 14:40:43,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:43,881 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:43,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:40:43,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:40:43,882 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-02-08 14:40:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:43,899 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2025-02-08 14:40:43,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2025-02-08 14:40:43,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:40:43,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2025-02-08 14:40:43,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:40:43,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:40:43,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-02-08 14:40:43,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:43,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-08 14:40:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-02-08 14:40:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-08 14:40:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) 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-02-08 14:40:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-02-08 14:40:43,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-08 14:40:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:40:43,902 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-08 14:40:43,902 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:40:43,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-02-08 14:40:43,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:40:43,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:43,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:43,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:43,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-02-08 14:40:43,904 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-02-08 14:40:43,904 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-02-08 14:40:43,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 38, now seen corresponding path program 3 times [2025-02-08 14:40:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593363384] [2025-02-08 14:40:43,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:40:43,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:43,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:43,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:43,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1034466655, now seen corresponding path program 2 times [2025-02-08 14:40:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164450623] [2025-02-08 14:40:43,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:43,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:40:43,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:40:43,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:43,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164450623] [2025-02-08 14:40:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164450623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167938056] [2025-02-08 14:40:43,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:43,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:40:44,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:40:44,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:40:44,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:44,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:44,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:40:44,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:44,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167938056] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:44,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-08 14:40:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065102615] [2025-02-08 14:40:44,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:44,104 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:40:44,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:40:44,105 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-02-08 14:40:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:44,123 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2025-02-08 14:40:44,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2025-02-08 14:40:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:40:44,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2025-02-08 14:40:44,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:40:44,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:40:44,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-02-08 14:40:44,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:44,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:40:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-02-08 14:40:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 14:40:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-08 14:40:44,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:40:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:40:44,127 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:40:44,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:40:44,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-02-08 14:40:44,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:40:44,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:44,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:44,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:44,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-02-08 14:40:44,128 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-02-08 14:40:44,128 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-02-08 14:40:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 38, now seen corresponding path program 4 times [2025-02-08 14:40:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282994146] [2025-02-08 14:40:44,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:40:44,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:40:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1985011167, now seen corresponding path program 3 times [2025-02-08 14:40:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069549686] [2025-02-08 14:40:44,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-02-08 14:40:44,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:40:44,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:40:44,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:40:44,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:40:44,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash -466294524, now seen corresponding path program 1 times [2025-02-08 14:40:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906233113] [2025-02-08 14:40:44,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:40:44,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:40:44,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:40:44,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:40:44,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,290 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:44,291 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:44,294 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:44,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:44,295 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:44,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:44,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:44,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2025-02-08 14:40:44,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:44,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:44,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:44,379 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:40:44,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:44,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:44,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:40:44,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:44,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:44,456 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:44,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,460 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:44,460 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:44,460 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:44,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:44,460 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:44,460 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,460 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:44,460 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:44,460 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2025-02-08 14:40:44,460 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:44,460 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:44,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:44,503 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:44,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:40:44,509 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-02-08 14:40:44,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:44,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:44,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:44,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:44,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:44,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:44,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:44,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:40:44,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:40:44,539 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-02-08 14:40:44,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:44,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:44,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:44,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:44,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:44,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:44,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:44,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:44,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:44,557 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:44,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:40:44,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:44,565 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:44,565 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:44,565 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2025-02-08 14:40:44,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,576 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:44,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:44,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:44,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:40:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:40:44,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:44,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:44,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 14:40:44,654 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-02-08 14:40:44,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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-02-08 14:40:44,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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 17 states and 20 transitions. Complement of second has 4 states. [2025-02-08 14:40:44,681 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-02-08 14:40:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) 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-02-08 14:40:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-02-08 14:40:44,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-08 14:40:44,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 9 letters. Loop has 8 letters. [2025-02-08 14:40:44,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 16 letters. [2025-02-08 14:40:44,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2025-02-08 14:40:44,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:40:44,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2025-02-08 14:40:44,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:40:44,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:40:44,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2025-02-08 14:40:44,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:40:44,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-08 14:40:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2025-02-08 14:40:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2025-02-08 14:40:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-02-08 14:40:44,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-08 14:40:44,687 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-08 14:40:44,687 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:40:44,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2025-02-08 14:40:44,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:40:44,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:44,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:44,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:40:44,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:40:44,688 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-02-08 14:40:44,688 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" [2025-02-08 14:40:44,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1183, now seen corresponding path program 1 times [2025-02-08 14:40:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168500004] [2025-02-08 14:40:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:44,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:44,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:44,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-02-08 14:40:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945048640] [2025-02-08 14:40:44,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 36677, now seen corresponding path program 1 times [2025-02-08 14:40:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209665461] [2025-02-08 14:40:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:44,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:44,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:40:44,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:40:44,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,719 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:44,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:44,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:44,720 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:44,720 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:44,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:44,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:44,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2025-02-08 14:40:44,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:44,720 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:44,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:44,741 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:40:44,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:44,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:44,758 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:40:44,758 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:40:44,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:40:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:40:44,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:44,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:44,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:40:44,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:44,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:44,817 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:44,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:44,821 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:44,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:44,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:44,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:44,821 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:44,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:44,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:44,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2025-02-08 14:40:44,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:44,822 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:44,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:44,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:44,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,847 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:40:44,852 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-02-08 14:40:44,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:44,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:44,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:44,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:44,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:44,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:44,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:44,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:40:44,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:40:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,877 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:40:44,879 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-02-08 14:40:44,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:44,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:44,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:44,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:44,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:44,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:44,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:44,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:44,895 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:44,895 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:44,897 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:44,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:40:44,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:44,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:44,902 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:44,902 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-02-08 14:40:44,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:40:44,909 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:44,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:44,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:44,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:44,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:44,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:44,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:44,933 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-02-08 14:40:44,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 1.5) 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-02-08 14:40:44,940 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 1.5) 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) Result 22 states and 27 transitions. Complement of second has 5 states. [2025-02-08 14:40:44,940 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-02-08 14:40:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) 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-02-08 14:40:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-02-08 14:40:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-08 14:40:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-08 14:40:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-08 14:40:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:44,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2025-02-08 14:40:44,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:40:44,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 23 transitions. [2025-02-08 14:40:44,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:40:44,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:40:44,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2025-02-08 14:40:44,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:40:44,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-08 14:40:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2025-02-08 14:40:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 11. [2025-02-08 14:40:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-08 14:40:44,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:40:44,947 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:40:44,947 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:40:44,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-02-08 14:40:44,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:40:44,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:44,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:44,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 2, 1, 1] [2025-02-08 14:40:44,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:40:44,948 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-02-08 14:40:44,948 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" [2025-02-08 14:40:44,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1570228351, now seen corresponding path program 2 times [2025-02-08 14:40:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486421105] [2025-02-08 14:40:44,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:40:44,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:44,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:44,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:40:44,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:44,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 2 times [2025-02-08 14:40:44,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636624603] [2025-02-08 14:40:44,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:44,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:44,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1432438621, now seen corresponding path program 3 times [2025-02-08 14:40:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467102989] [2025-02-08 14:40:44,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:44,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 5 equivalence classes. [2025-02-08 14:40:44,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:40:44,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:40:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:44,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:44,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:40:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:40:44,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:44,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:45,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:45,018 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:45,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:45,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:45,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:45,018 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:40:45,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:45,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:45,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2025-02-08 14:40:45,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:45,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:45,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:45,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:45,051 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:45,051 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:40:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:45,056 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:45,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:40:45,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:40:45,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:45,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:40:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:45,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:45,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:40:45,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:40:45,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:40:45,119 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:40:45,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:40:45,127 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:40:45,127 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:40:45,127 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:40:45,127 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:40:45,127 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:40:45,127 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,127 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:40:45,127 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:40:45,127 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2025-02-08 14:40:45,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:40:45,128 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:40:45,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:45,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:40:45,160 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:40:45,163 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:40:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:45,166 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:45,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:40:45,171 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-02-08 14:40:45,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:40:45,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:40:45,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:40:45,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:40:45,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:40:45,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:40:45,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:40:45,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:40:45,192 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:40:45,192 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:40:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:45,194 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:45,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:40:45,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:40:45,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:40:45,198 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:40:45,198 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-02-08 14:40:45,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:45,207 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:40:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:40:45,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:45,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:45,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:45,266 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-02-08 14:40:45,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 24 transitions. Complement of second has 5 states. [2025-02-08 14:40:45,279 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-02-08 14:40:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-02-08 14:40:45,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 10 letters. Loop has 1 letters. [2025-02-08 14:40:45,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:45,279 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:40:45,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:45,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:40:45,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:45,330 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:40:45,330 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 24 transitions. Complement of second has 5 states. [2025-02-08 14:40:45,335 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-02-08 14:40:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-02-08 14:40:45,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 10 letters. Loop has 1 letters. [2025-02-08 14:40:45,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:45,336 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:40:45,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:45,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:40:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:45,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:45,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:45,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:45,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:45,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:40:45,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:45,371 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:40:45,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 15 transitions. Complement of second has 4 states. [2025-02-08 14:40:45,377 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-02-08 14:40:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 14:40:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-08 14:40:45,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 1 letters. [2025-02-08 14:40:45,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:45,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 11 letters. Loop has 1 letters. [2025-02-08 14:40:45,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:45,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-08 14:40:45,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:40:45,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2025-02-08 14:40:45,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:40:45,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2025-02-08 14:40:45,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:40:45,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:40:45,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:40:45,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:45,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:45,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:45,379 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:40:45,379 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:40:45,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:40:45,380 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:40:45,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:40:45,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:40:45 BoogieIcfgContainer [2025-02-08 14:40:45,385 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:40:45,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:40:45,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:40:45,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:40:45,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:43" (3/4) ... [2025-02-08 14:40:45,388 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:40:45,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:40:45,389 INFO L158 Benchmark]: Toolchain (without parser) took 2529.17ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 56.4MB in the end (delta: 57.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-02-08 14:40:45,389 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:45,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:40:45,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.6MB in the end (delta: 920.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:45,389 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.7MB in the end (delta: 920.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:45,389 INFO L158 Benchmark]: IcfgBuilder took 246.44ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.3MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:40:45,390 INFO L158 Benchmark]: BuchiAutomizer took 2034.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 56.4MB in the end (delta: 34.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-02-08 14:40:45,390 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:40:45,391 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.28ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.6MB in the end (delta: 920.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.7MB in the end (delta: 920.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 246.44ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.3MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2034.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 56.4MB in the end (delta: 34.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 21/21 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 29 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:40:45,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:40:45,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:40:45,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:40:46,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:40:46,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:40:46,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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