./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/termination-restricted-15/Narrowing.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:01:17,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:01:17,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:01:17,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:01:17,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:01:17,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:01:18,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:01:18,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:01:18,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:01:18,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:01:18,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:01:18,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:01:18,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:01:18,012 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:01:18,012 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:01:18,012 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:01:18,012 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:01:18,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:01:18,013 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:01:18,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:01:18,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:01:18,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:01:18,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:01:18,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:01:18,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:01:18,015 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:01:18,015 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2025-02-06 19:01:18,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:01:18,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:01:18,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:01:18,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:01:18,265 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:01:18,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2025-02-06 19:01:19,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc55af0a5/0f1898a6a5f343fa83c4764ef3780699/FLAG74f7b140f [2025-02-06 19:01:19,658 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:01:19,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2025-02-06 19:01:19,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc55af0a5/0f1898a6a5f343fa83c4764ef3780699/FLAG74f7b140f [2025-02-06 19:01:19,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc55af0a5/0f1898a6a5f343fa83c4764ef3780699 [2025-02-06 19:01:19,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:01:19,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:01:19,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:19,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:01:19,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:01:19,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d86a0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19, skipping insertion in model container [2025-02-06 19:01:19,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:01:19,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:19,829 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:01:19,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:19,848 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:01:19,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19 WrapperNode [2025-02-06 19:01:19,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:19,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:19,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:01:19,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:01:19,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,866 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-02-06 19:01:19,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:19,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:01:19,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:01:19,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:01:19,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,878 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 19:01:19,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:01:19,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:01:19,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:01:19,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:01:19,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (1/1) ... [2025-02-06 19:01:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:19,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:19,912 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-06 19:01:19,916 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-06 19:01:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:01:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:01:19,979 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:01:19,980 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:01:20,053 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-06 19:01:20,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:01:20,059 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:01:20,059 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:01:20,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:20 BoogieIcfgContainer [2025-02-06 19:01:20,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:01:20,060 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:01:20,060 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:01:20,065 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:01:20,066 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:20,066 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:01:19" (1/3) ... [2025-02-06 19:01:20,067 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c668b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:20, skipping insertion in model container [2025-02-06 19:01:20,067 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:20,067 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:19" (2/3) ... [2025-02-06 19:01:20,067 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c668b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:20, skipping insertion in model container [2025-02-06 19:01:20,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:20,068 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:20" (3/3) ... [2025-02-06 19:01:20,069 INFO L363 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2025-02-06 19:01:20,110 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:01:20,110 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:01:20,110 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:01:20,110 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:01:20,110 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:01:20,111 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:01:20,111 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:01:20,111 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:01:20,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:20,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:01:20,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:20,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:20,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:20,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:20,129 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:01:20,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:20,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:01:20,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:20,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:20,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:20,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:20,136 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-02-06 19:01:20,136 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2025-02-06 19:01:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2025-02-06 19:01:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355564788] [2025-02-06 19:01:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1270116379, now seen corresponding path program 1 times [2025-02-06 19:01:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784169929] [2025-02-06 19:01:20,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:20,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,301 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-06 19:01:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784169929] [2025-02-06 19:01:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784169929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623872080] [2025-02-06 19:01:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:20,309 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:20,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:20,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:20,332 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-06 19:01:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:20,362 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2025-02-06 19:01:20,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 28 transitions. [2025-02-06 19:01:20,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-06 19:01:20,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 23 transitions. [2025-02-06 19:01:20,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:01:20,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:01:20,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2025-02-06 19:01:20,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:01:20,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-06 19:01:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2025-02-06 19:01:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-06 19:01:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2025-02-06 19:01:20,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-06 19:01:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:20,395 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-06 19:01:20,396 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:01:20,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2025-02-06 19:01:20,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-06 19:01:20,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:20,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:20,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:20,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:20,398 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-02-06 19:01:20,398 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2025-02-06 19:01:20,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 2 times [2025-02-06 19:01:20,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898334396] [2025-02-06 19:01:20,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:20,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1271040861, now seen corresponding path program 1 times [2025-02-06 19:01:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207605884] [2025-02-06 19:01:20,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:20,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:20,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,444 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-06 19:01:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207605884] [2025-02-06 19:01:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207605884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846955912] [2025-02-06 19:01:20,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:20,449 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:01:20,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:01:20,451 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 19:01:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:20,497 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2025-02-06 19:01:20,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2025-02-06 19:01:20,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-02-06 19:01:20,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2025-02-06 19:01:20,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-06 19:01:20,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-06 19:01:20,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2025-02-06 19:01:20,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:01:20,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-02-06 19:01:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2025-02-06 19:01:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 19:01:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 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-06 19:01:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2025-02-06 19:01:20,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-02-06 19:01:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:01:20,510 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-02-06 19:01:20,510 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:01:20,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2025-02-06 19:01:20,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-02-06 19:01:20,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:20,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:20,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:20,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:20,513 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-02-06 19:01:20,513 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" [2025-02-06 19:01:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 3 times [2025-02-06 19:01:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445639377] [2025-02-06 19:01:20,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:01:20,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1270146171, now seen corresponding path program 1 times [2025-02-06 19:01:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860919442] [2025-02-06 19:01:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:20,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:20,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,552 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-06 19:01:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860919442] [2025-02-06 19:01:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860919442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120838556] [2025-02-06 19:01:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:20,553 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:20,554 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-06 19:01:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:20,565 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2025-02-06 19:01:20,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2025-02-06 19:01:20,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-02-06 19:01:20,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2025-02-06 19:01:20,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-06 19:01:20,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-06 19:01:20,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2025-02-06 19:01:20,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:01:20,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2025-02-06 19:01:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2025-02-06 19:01:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-02-06 19:01:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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-06 19:01:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2025-02-06 19:01:20,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2025-02-06 19:01:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:20,572 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2025-02-06 19:01:20,572 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:01:20,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2025-02-06 19:01:20,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-02-06 19:01:20,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:20,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:20,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:20,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:20,573 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-02-06 19:01:20,573 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" [2025-02-06 19:01:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 4 times [2025-02-06 19:01:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249601607] [2025-02-06 19:01:20,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:01:20,577 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,577 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:20,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070653, now seen corresponding path program 1 times [2025-02-06 19:01:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039310492] [2025-02-06 19:01:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:20,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:20,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:20,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1511386596, now seen corresponding path program 1 times [2025-02-06 19:01:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55529031] [2025-02-06 19:01:20,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:20,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:20,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:20,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:20,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:20,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:20,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:20,696 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:20,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:20,696 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:20,696 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:20,697 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:20,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:20,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:20,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2025-02-06 19:01:20,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:20,697 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:20,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,803 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:20,803 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:20,806 INFO L229 MonitoredProcess]: Starting monitored process 2 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-06 19:01:20,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:01:20,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:20,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:20,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:01:20,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:20,830 INFO L229 MonitoredProcess]: Starting monitored process 3 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-06 19:01:20,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:01:20,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:20,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:20,856 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:20,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:01:20,860 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:20,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:20,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:20,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:20,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:20,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:20,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:20,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2025-02-06 19:01:20,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:20,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:20,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:20,942 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:20,945 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:20,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:20,948 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-06 19:01:20,949 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-06 19:01:20,950 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-06 19:01:20,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:20,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:20,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:20,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:20,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:20,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:20,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:20,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:20,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:20,974 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:20,977 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-06 19:01:20,979 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-06 19:01:20,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:20,980 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:20,981 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:20,981 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:01:20,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:01:20,988 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:21,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:21,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:21,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:21,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:21,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:21,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:21,061 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-06 19:01:21,063 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:21,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-06 19:01:21,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) Result 100 states and 152 transitions. Complement of second has 7 states. [2025-02-06 19:01:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-06 19:01:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-02-06 19:01:21,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-06 19:01:21,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-06 19:01:21,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2025-02-06 19:01:21,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2025-02-06 19:01:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2025-02-06 19:01:21,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2025-02-06 19:01:21,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-06 19:01:21,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-02-06 19:01:21,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2025-02-06 19:01:21,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:21,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2025-02-06 19:01:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2025-02-06 19:01:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2025-02-06 19:01:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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-06 19:01:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-02-06 19:01:21,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-02-06 19:01:21,145 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-02-06 19:01:21,145 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:01:21,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2025-02-06 19:01:21,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-02-06 19:01:21,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:21,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:21,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:01:21,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:21,146 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" [2025-02-06 19:01:21,146 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" [2025-02-06 19:01:21,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 44653, now seen corresponding path program 1 times [2025-02-06 19:01:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471776343] [2025-02-06 19:01:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:01:21,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:01:21,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:01:21,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:01:21,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1240532934, now seen corresponding path program 1 times [2025-02-06 19:01:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260835810] [2025-02-06 19:01:21,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:21,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 391656754, now seen corresponding path program 1 times [2025-02-06 19:01:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638205192] [2025-02-06 19:01:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:01:21,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:01:21,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638205192] [2025-02-06 19:01:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638205192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:21,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:21,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524598351] [2025-02-06 19:01:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:21,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:21,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:21,228 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:21,240 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2025-02-06 19:01:21,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2025-02-06 19:01:21,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2025-02-06 19:01:21,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2025-02-06 19:01:21,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-06 19:01:21,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-06 19:01:21,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2025-02-06 19:01:21,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:21,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2025-02-06 19:01:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2025-02-06 19:01:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-06 19:01:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 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-06 19:01:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2025-02-06 19:01:21,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2025-02-06 19:01:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:21,252 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2025-02-06 19:01:21,252 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:01:21,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2025-02-06 19:01:21,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-06 19:01:21,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:21,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:21,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:01:21,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:21,253 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:21,253 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1384254, now seen corresponding path program 1 times [2025-02-06 19:01:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255141575] [2025-02-06 19:01:21,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:21,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366363, now seen corresponding path program 1 times [2025-02-06 19:01:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606323268] [2025-02-06 19:01:21,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:21,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:21,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:21,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:21,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1631046184, now seen corresponding path program 1 times [2025-02-06 19:01:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110219270] [2025-02-06 19:01:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:21,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:21,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110219270] [2025-02-06 19:01:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110219270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:01:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234568904] [2025-02-06 19:01:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:21,353 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:21,353 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:21,353 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:21,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:21,353 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:21,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:21,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:21,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-02-06 19:01:21,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:21,353 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:21,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,464 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:21,464 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:21,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,467 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-06 19:01:21,469 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-06 19:01:21,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:21,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:21,488 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:21,488 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:21,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:01:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,497 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-06 19:01:21,508 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-06 19:01:21,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:21,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:21,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:01:21,532 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:21,532 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~range~0#1=1} Honda state: {ULTIMATE.start_main_~range~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:21,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:01:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,542 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-06 19:01:21,544 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-06 19:01:21,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:21,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:21,564 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:21,564 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:21,571 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-06 19:01:21,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,573 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-06 19:01:21,574 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-06 19:01:21,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:21,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:21,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,600 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-06 19:01:21,601 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-06 19:01:21,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:21,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:21,629 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:21,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:01:21,633 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:21,633 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:21,633 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:21,633 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:21,633 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:21,633 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,633 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:21,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:21,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-02-06 19:01:21,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:21,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:21,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:21,734 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:21,734 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:21,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,736 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-06 19:01:21,737 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-06 19:01:21,738 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-06 19:01:21,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:21,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:21,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:21,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,760 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-06 19:01:21,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,763 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-06 19:01:21,764 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-06 19:01:21,764 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-06 19:01:21,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,774 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:21,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:21,775 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:21,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,782 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-06 19:01:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,784 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-06 19:01:21,785 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-06 19:01:21,786 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-06 19:01:21,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,799 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:21,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:21,800 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:21,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,809 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-06 19:01:21,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,811 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-06 19:01:21,811 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-06 19:01:21,812 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-06 19:01:21,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:21,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:21,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:21,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,835 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-06 19:01:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,838 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-06 19:01:21,839 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-06 19:01:21,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:21,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:21,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:21,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,857 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-06 19:01:21,858 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-02-06 19:01:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,860 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-06 19:01:21,861 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-06 19:01:21,862 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-06 19:01:21,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,873 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:21,875 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-02-06 19:01:21,875 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-02-06 19:01:21,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,888 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-06 19:01:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,890 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-06 19:01:21,891 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-06 19:01:21,892 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-06 19:01:21,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,902 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:21,902 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:21,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:21,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,911 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-06 19:01:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,913 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-06 19:01:21,915 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-06 19:01:21,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:21,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,926 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:21,926 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:21,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:21,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:21,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,939 INFO L229 MonitoredProcess]: Starting monitored process 19 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-06 19:01:21,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:01:21,941 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-06 19:01:21,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:21,953 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-02-06 19:01:21,953 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-02-06 19:01:21,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:01:21,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,965 INFO L229 MonitoredProcess]: Starting monitored process 20 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-06 19:01:21,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:01:21,968 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-06 19:01:21,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:21,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,978 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:21,978 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:01:21,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:21,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:21,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:01:21,985 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-02-06 19:01:21,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:21,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,987 INFO L229 MonitoredProcess]: Starting monitored process 21 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-06 19:01:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:01:21,989 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-06 19:01:21,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:21,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:21,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:21,999 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,005 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,006 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:01:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,021 INFO L229 MonitoredProcess]: Starting monitored process 22 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-06 19:01:22,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:01:22,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:22,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,035 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,035 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,037 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,051 INFO L229 MonitoredProcess]: Starting monitored process 23 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-06 19:01:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:01:22,053 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-06 19:01:22,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,064 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,064 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,065 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:01:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,076 INFO L229 MonitoredProcess]: Starting monitored process 24 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-06 19:01:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:01:22,078 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-06 19:01:22,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,088 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,091 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,091 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:01:22,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,104 INFO L229 MonitoredProcess]: Starting monitored process 25 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-06 19:01:22,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:01:22,108 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-06 19:01:22,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,119 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,121 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:22,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:01:22,128 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-02-06 19:01:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,130 INFO L229 MonitoredProcess]: Starting monitored process 26 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-06 19:01:22,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:01:22,132 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-06 19:01:22,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,143 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,145 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-02-06 19:01:22,146 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-02-06 19:01:22,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:01:22,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,158 INFO L229 MonitoredProcess]: Starting monitored process 27 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-06 19:01:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:01:22,159 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-06 19:01:22,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,171 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,171 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,177 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:01:22,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:01:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,191 INFO L229 MonitoredProcess]: Starting monitored process 28 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-06 19:01:22,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:01:22,194 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-06 19:01:22,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,205 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,205 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,207 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:01:22,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,222 INFO L229 MonitoredProcess]: Starting monitored process 29 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-06 19:01:22,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:01:22,225 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-06 19:01:22,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,236 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,239 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-02-06 19:01:22,239 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-02-06 19:01:22,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,255 INFO L229 MonitoredProcess]: Starting monitored process 30 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-06 19:01:22,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:01:22,256 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-06 19:01:22,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:22,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,267 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,268 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:01:22,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:01:22,276 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-02-06 19:01:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,278 INFO L229 MonitoredProcess]: Starting monitored process 31 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-06 19:01:22,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:01:22,279 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-06 19:01:22,290 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,290 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,290 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:22,292 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-02-06 19:01:22,292 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-02-06 19:01:22,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:01:22,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,307 INFO L229 MonitoredProcess]: Starting monitored process 32 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-06 19:01:22,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:01:22,310 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-06 19:01:22,321 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,322 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,322 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,322 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:22,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:22,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,338 INFO L229 MonitoredProcess]: Starting monitored process 33 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-06 19:01:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:01:22,342 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-06 19:01:22,352 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,352 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,352 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,352 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:22,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:22,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,366 INFO L229 MonitoredProcess]: Starting monitored process 34 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-06 19:01:22,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:01:22,368 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-06 19:01:22,378 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,378 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,378 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:22,380 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-02-06 19:01:22,380 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-02-06 19:01:22,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-06 19:01:22,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,392 INFO L229 MonitoredProcess]: Starting monitored process 35 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-06 19:01:22,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:01:22,395 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-06 19:01:22,404 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,404 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,405 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-02-06 19:01:22,405 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-02-06 19:01:22,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:01:22,414 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-02-06 19:01:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,415 INFO L229 MonitoredProcess]: Starting monitored process 36 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-06 19:01:22,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:01:22,418 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-06 19:01:22,430 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,430 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:01:22,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,430 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,437 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,437 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:01:22,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,454 INFO L229 MonitoredProcess]: Starting monitored process 37 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-06 19:01:22,456 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-06 19:01:22,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:01:22,467 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,467 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:01:22,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,467 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,467 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,469 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:01:22,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,489 INFO L229 MonitoredProcess]: Starting monitored process 38 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-06 19:01:22,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:01:22,492 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-06 19:01:22,503 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,503 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:01:22,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,504 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,504 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,506 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:01:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,528 INFO L229 MonitoredProcess]: Starting monitored process 39 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-06 19:01:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:01:22,530 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-06 19:01:22,541 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,541 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:01:22,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,541 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,543 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,543 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 19:01:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,557 INFO L229 MonitoredProcess]: Starting monitored process 40 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-06 19:01:22,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:01:22,558 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-06 19:01:22,568 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,568 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-02-06 19:01:22,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,568 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,569 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:22,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-06 19:01:22,578 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-02-06 19:01:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,580 INFO L229 MonitoredProcess]: Starting monitored process 41 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-06 19:01:22,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:01:22,581 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-06 19:01:22,591 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,592 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,592 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,594 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-02-06 19:01:22,594 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-02-06 19:01:22,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:01:22,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,609 INFO L229 MonitoredProcess]: Starting monitored process 42 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-06 19:01:22,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:01:22,611 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-06 19:01:22,621 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,621 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,621 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,621 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,623 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:01:22,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:01:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,643 INFO L229 MonitoredProcess]: Starting monitored process 43 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-06 19:01:22,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:01:22,646 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-06 19:01:22,657 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,657 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,658 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,658 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,661 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-02-06 19:01:22,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 19:01:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,679 INFO L229 MonitoredProcess]: Starting monitored process 44 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-06 19:01:22,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:01:22,681 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-06 19:01:22,692 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,692 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,692 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,695 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-02-06 19:01:22,695 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-02-06 19:01:22,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,710 INFO L229 MonitoredProcess]: Starting monitored process 45 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-06 19:01:22,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 19:01:22,712 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-06 19:01:22,723 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,723 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,723 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-02-06 19:01:22,724 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-02-06 19:01:22,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-06 19:01:22,733 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-02-06 19:01:22,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,736 INFO L229 MonitoredProcess]: Starting monitored process 46 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-06 19:01:22,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-06 19:01:22,738 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-06 19:01:22,749 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,749 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,749 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,751 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,751 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,763 INFO L229 MonitoredProcess]: Starting monitored process 47 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-06 19:01:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 19:01:22,766 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-06 19:01:22,776 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,776 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,776 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,776 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,777 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,790 INFO L229 MonitoredProcess]: Starting monitored process 48 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-06 19:01:22,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-06 19:01:22,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:22,803 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,803 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,803 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,803 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,805 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:01:22,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 19:01:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,819 INFO L229 MonitoredProcess]: Starting monitored process 49 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-06 19:01:22,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-06 19:01:22,821 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-06 19:01:22,831 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,832 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,832 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,834 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,834 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:01:22,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 19:01:22,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,847 INFO L229 MonitoredProcess]: Starting monitored process 50 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-06 19:01:22,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-06 19:01:22,849 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-06 19:01:22,859 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,860 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-02-06 19:01:22,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,860 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-02-06 19:01:22,861 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:22,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-02-06 19:01:22,869 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-02-06 19:01:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,871 INFO L229 MonitoredProcess]: Starting monitored process 51 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-06 19:01:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-06 19:01:22,874 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-06 19:01:22,885 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,885 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,885 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:01:22,887 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-02-06 19:01:22,888 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-02-06 19:01:22,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,904 INFO L229 MonitoredProcess]: Starting monitored process 52 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-06 19:01:22,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-06 19:01:22,907 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-06 19:01:22,917 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,917 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,917 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,918 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:01:22,919 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-06 19:01:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,932 INFO L229 MonitoredProcess]: Starting monitored process 53 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-06 19:01:22,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:01:22,934 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-06 19:01:22,945 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,945 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:22,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,945 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:22,945 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:01:22,947 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:01:22,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:22,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:22,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:22,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:22,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,982 INFO L229 MonitoredProcess]: Starting monitored process 54 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-06 19:01:22,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-06 19:01:22,985 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-06 19:01:22,995 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:22,996 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:22,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:22,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:22,996 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:01:22,998 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-02-06 19:01:22,998 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-02-06 19:01:23,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:23,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,012 INFO L229 MonitoredProcess]: Starting monitored process 55 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-06 19:01:23,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-06 19:01:23,014 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-06 19:01:23,024 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-02-06 19:01:23,024 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-02-06 19:01:23,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:23,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:23,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:23,024 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-02-06 19:01:23,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:23,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:23,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:23,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:23,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:23,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:23,034 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-06 19:01:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:23,041 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-02-06 19:01:23,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2025-02-06 19:01:23,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-02-06 19:01:23,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2025-02-06 19:01:23,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-06 19:01:23,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-06 19:01:23,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2025-02-06 19:01:23,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:23,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-02-06 19:01:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2025-02-06 19:01:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-02-06 19:01:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 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-06 19:01:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-02-06 19:01:23,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-02-06 19:01:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:23,045 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-02-06 19:01:23,045 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:01:23,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2025-02-06 19:01:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-02-06 19:01:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:23,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:23,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:01:23,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:23,046 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:23,046 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 42911884, now seen corresponding path program 1 times [2025-02-06 19:01:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762652734] [2025-02-06 19:01:23,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:23,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:23,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:23,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:23,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580872, now seen corresponding path program 1 times [2025-02-06 19:01:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514790284] [2025-02-06 19:01:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:23,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:23,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:23,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:23,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:23,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 948546707, now seen corresponding path program 1 times [2025-02-06 19:01:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310955536] [2025-02-06 19:01:23,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:23,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:23,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310955536] [2025-02-06 19:01:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310955536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:01:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240835048] [2025-02-06 19:01:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:23,165 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:23,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:23,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:23,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:23,165 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:23,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:23,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:23,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-02-06 19:01:23,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:23,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:23,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,225 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:23,226 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,228 INFO L229 MonitoredProcess]: Starting monitored process 56 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-06 19:01:23,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-06 19:01:23,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:23,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,248 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:23,248 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:23,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-06 19:01:23,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,255 INFO L229 MonitoredProcess]: Starting monitored process 57 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-06 19:01:23,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-06 19:01:23,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:23,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,267 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:23,267 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:23,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,274 INFO L229 MonitoredProcess]: Starting monitored process 58 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-06 19:01:23,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-06 19:01:23,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:23,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-06 19:01:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,293 INFO L229 MonitoredProcess]: Starting monitored process 59 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-06 19:01:23,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-06 19:01:23,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:23,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,314 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:23,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:01:23,318 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:23,318 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:23,318 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:23,318 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:23,318 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:23,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:23,319 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:23,319 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-02-06 19:01:23,319 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:23,319 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:23,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,387 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:23,388 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:23,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,392 INFO L229 MonitoredProcess]: Starting monitored process 60 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-06 19:01:23,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-06 19:01:23,394 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-06 19:01:23,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:23,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:23,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:23,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:23,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:23,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:23,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:23,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:23,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,415 INFO L229 MonitoredProcess]: Starting monitored process 61 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-06 19:01:23,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-06 19:01:23,417 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-06 19:01:23,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:23,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:23,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:23,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:23,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:23,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:23,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:23,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,438 INFO L229 MonitoredProcess]: Starting monitored process 62 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-06 19:01:23,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-06 19:01:23,440 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-06 19:01:23,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:23,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:23,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:23,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:23,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:23,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:23,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:23,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:23,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:23,455 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:23,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,458 INFO L229 MonitoredProcess]: Starting monitored process 63 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-06 19:01:23,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-06 19:01:23,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:23,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:23,460 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:23,460 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:01:23,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-06 19:01:23,467 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:23,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:23,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:23,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:23,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:23,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:23,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:23,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:23,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:23,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:23,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:23,510 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-06 19:01:23,511 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:23,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:23,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 154 transitions. Complement of second has 7 states. [2025-02-06 19:01:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-02-06 19:01:23,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-06 19:01:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:23,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:23,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 12 letters. [2025-02-06 19:01:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:23,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 154 transitions. [2025-02-06 19:01:23,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2025-02-06 19:01:23,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 109 states and 145 transitions. [2025-02-06 19:01:23,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-06 19:01:23,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-06 19:01:23,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2025-02-06 19:01:23,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:23,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 145 transitions. [2025-02-06 19:01:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2025-02-06 19:01:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2025-02-06 19:01:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.372340425531915) internal successors, (129), 93 states have internal predecessors, (129), 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-06 19:01:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-02-06 19:01:23,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-02-06 19:01:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:23,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:01:23,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:01:23,565 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:23,589 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2025-02-06 19:01:23,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 143 transitions. [2025-02-06 19:01:23,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2025-02-06 19:01:23,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 93 states and 119 transitions. [2025-02-06 19:01:23,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-02-06 19:01:23,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-06 19:01:23,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 119 transitions. [2025-02-06 19:01:23,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:23,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 119 transitions. [2025-02-06 19:01:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 119 transitions. [2025-02-06 19:01:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 42. [2025-02-06 19:01:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 41 states have internal predecessors, (56), 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-06 19:01:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-02-06 19:01:23,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-02-06 19:01:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:01:23,594 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-02-06 19:01:23,594 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:01:23,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2025-02-06 19:01:23,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-02-06 19:01:23,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:23,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:23,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:01:23,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:23,595 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:23,595 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 42911884, now seen corresponding path program 2 times [2025-02-06 19:01:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382923275] [2025-02-06 19:01:23,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:23,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:23,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:23,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:23,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:23,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:23,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580903, now seen corresponding path program 1 times [2025-02-06 19:01:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823031483] [2025-02-06 19:01:23,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:23,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:23,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:23,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:23,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:23,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 948546738, now seen corresponding path program 1 times [2025-02-06 19:01:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863678257] [2025-02-06 19:01:23,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:23,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:23,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:23,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:23,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:23,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:23,660 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:23,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:23,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:23,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:23,661 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:23,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:23,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:23,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-02-06 19:01:23,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:23,661 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:23,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,746 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:23,746 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:23,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,748 INFO L229 MonitoredProcess]: Starting monitored process 64 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-06 19:01:23,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-06 19:01:23,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:23,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-06 19:01:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,767 INFO L229 MonitoredProcess]: Starting monitored process 65 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-06 19:01:23,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-06 19:01:23,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:23,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:23,909 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:23,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:23,916 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:23,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:23,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:23,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:23,916 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:23,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:23,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:23,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-02-06 19:01:23,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:23,916 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:23,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:23,998 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:23,998 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:23,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,999 INFO L229 MonitoredProcess]: Starting monitored process 66 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-06 19:01:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-06 19:01:24,001 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-06 19:01:24,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:24,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:24,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:24,011 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:24,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:24,011 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:24,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:24,014 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:24,017 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:01:24,017 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,020 INFO L229 MonitoredProcess]: Starting monitored process 67 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-06 19:01:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-06 19:01:24,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:24,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:24,021 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:24,021 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2025-02-06 19:01:24,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-06 19:01:24,031 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:24,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:01:24,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:01:24,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:24,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:01:24,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:24,078 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-06 19:01:24,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:24,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 116 transitions. Complement of second has 7 states. [2025-02-06 19:01:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-02-06 19:01:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-06 19:01:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 12 letters. [2025-02-06 19:01:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 116 transitions. [2025-02-06 19:01:24,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-02-06 19:01:24,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 99 transitions. [2025-02-06 19:01:24,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-06 19:01:24,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-06 19:01:24,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2025-02-06 19:01:24,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:24,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:01:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2025-02-06 19:01:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-02-06 19:01:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 71 states have internal predecessors, (93), 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-06 19:01:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-02-06 19:01:24,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-02-06 19:01:24,113 INFO L432 stractBuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-02-06 19:01:24,113 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:01:24,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 93 transitions. [2025-02-06 19:01:24,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-02-06 19:01:24,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:24,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:24,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:24,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:24,113 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" [2025-02-06 19:01:24,114 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" [2025-02-06 19:01:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 948516946, now seen corresponding path program 1 times [2025-02-06 19:01:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88378584] [2025-02-06 19:01:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:24,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:24,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88378584] [2025-02-06 19:01:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88378584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:01:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561112122] [2025-02-06 19:01:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:24,144 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1121286532, now seen corresponding path program 1 times [2025-02-06 19:01:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528956095] [2025-02-06 19:01:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:24,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:24,179 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:24,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:24,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:24,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:24,179 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:24,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:24,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:24,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-02-06 19:01:24,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:24,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:24,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,240 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:24,240 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,241 INFO L229 MonitoredProcess]: Starting monitored process 68 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-06 19:01:24,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-02-06 19:01:24,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:24,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,253 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:24,253 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:24,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-02-06 19:01:24,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,261 INFO L229 MonitoredProcess]: Starting monitored process 69 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-06 19:01:24,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-02-06 19:01:24,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:24,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,280 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:24,280 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:24,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-02-06 19:01:24,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,287 INFO L229 MonitoredProcess]: Starting monitored process 70 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-06 19:01:24,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-06 19:01:24,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:24,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,306 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:24,306 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:24,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-02-06 19:01:24,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,313 INFO L229 MonitoredProcess]: Starting monitored process 71 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-06 19:01:24,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-06 19:01:24,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:24,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-02-06 19:01:24,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,333 INFO L229 MonitoredProcess]: Starting monitored process 72 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-06 19:01:24,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-06 19:01:24,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:24,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,426 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:24,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:24,431 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:24,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:24,431 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:24,431 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:24,431 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:24,431 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:24,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:24,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-02-06 19:01:24,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:24,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:24,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,483 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:24,483 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:24,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,485 INFO L229 MonitoredProcess]: Starting monitored process 73 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-06 19:01:24,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-06 19:01:24,487 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-06 19:01:24,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:24,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:24,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:24,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:24,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:24,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:24,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:24,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:24,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-06 19:01:24,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,506 INFO L229 MonitoredProcess]: Starting monitored process 74 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-06 19:01:24,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-06 19:01:24,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-06 19:01:24,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:24,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:24,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:24,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:24,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:24,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:24,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:24,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:01:24,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,529 INFO L229 MonitoredProcess]: Starting monitored process 75 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-06 19:01:24,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-06 19:01:24,530 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-06 19:01:24,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:24,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:24,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:24,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:24,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:24,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:24,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:24,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-02-06 19:01:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,551 INFO L229 MonitoredProcess]: Starting monitored process 76 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-06 19:01:24,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-06 19:01:24,554 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-06 19:01:24,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:24,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:24,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:24,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:24,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:24,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:24,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:24,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:24,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:24,570 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,594 INFO L229 MonitoredProcess]: Starting monitored process 77 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-06 19:01:24,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:24,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-06 19:01:24,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:24,597 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:24,597 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:24,597 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:01:24,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-02-06 19:01:24,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:24,606 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:24,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:24,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:24,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:24,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:24,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:24,651 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-06 19:01:24,652 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:24,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 93 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 93 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 161 states and 214 transitions. Complement of second has 7 states. [2025-02-06 19:01:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-02-06 19:01:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 6 letters. [2025-02-06 19:01:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2025-02-06 19:01:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:24,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 214 transitions. [2025-02-06 19:01:24,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-06 19:01:24,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 127 states and 165 transitions. [2025-02-06 19:01:24,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-02-06 19:01:24,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-02-06 19:01:24,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 165 transitions. [2025-02-06 19:01:24,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:24,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 165 transitions. [2025-02-06 19:01:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 165 transitions. [2025-02-06 19:01:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2025-02-06 19:01:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 117 states have internal predecessors, (156), 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-06 19:01:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-02-06 19:01:24,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-02-06 19:01:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:01:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:01:24,680 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:24,708 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2025-02-06 19:01:24,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 284 transitions. [2025-02-06 19:01:24,710 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 80 [2025-02-06 19:01:24,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 218 states and 276 transitions. [2025-02-06 19:01:24,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-02-06 19:01:24,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2025-02-06 19:01:24,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 276 transitions. [2025-02-06 19:01:24,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:24,711 INFO L218 hiAutomatonCegarLoop]: Abstraction has 218 states and 276 transitions. [2025-02-06 19:01:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 276 transitions. [2025-02-06 19:01:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2025-02-06 19:01:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.277511961722488) internal successors, (267), 208 states have internal predecessors, (267), 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-06 19:01:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2025-02-06 19:01:24,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 267 transitions. [2025-02-06 19:01:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:01:24,722 INFO L432 stractBuchiCegarLoop]: Abstraction has 209 states and 267 transitions. [2025-02-06 19:01:24,722 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:01:24,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 267 transitions. [2025-02-06 19:01:24,723 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-02-06 19:01:24,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:24,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:24,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:24,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:01:24,724 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:24,724 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1575934415, now seen corresponding path program 1 times [2025-02-06 19:01:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145898510] [2025-02-06 19:01:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145898510] [2025-02-06 19:01:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145898510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637177942] [2025-02-06 19:01:24,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:24,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,751 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:24,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-02-06 19:01:24,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:24,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:24,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:01:24,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:24,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637177942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:24,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:24,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 19:01:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284459448] [2025-02-06 19:01:24,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:24,799 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:24,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580903, now seen corresponding path program 2 times [2025-02-06 19:01:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075023766] [2025-02-06 19:01:24,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:24,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:24,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:24,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:24,842 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:24,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:24,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:24,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:24,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:24,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:24,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:24,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration10_Loop [2025-02-06 19:01:24,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:24,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:24,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:24,924 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:24,925 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,926 INFO L229 MonitoredProcess]: Starting monitored process 79 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-06 19:01:24,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-06 19:01:24,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:24,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:24,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:24,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:24,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,946 INFO L229 MonitoredProcess]: Starting monitored process 80 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-06 19:01:24,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-06 19:01:24,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:24,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:25,094 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:25,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-06 19:01:25,101 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:25,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:25,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:25,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:25,101 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:25,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:25,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:25,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:25,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration10_Loop [2025-02-06 19:01:25,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:25,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:25,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:25,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:25,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:25,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:25,175 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:25,175 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:25,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:25,177 INFO L229 MonitoredProcess]: Starting monitored process 81 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-06 19:01:25,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-06 19:01:25,179 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-06 19:01:25,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:25,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:25,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:25,188 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:01:25,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:25,189 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-06 19:01:25,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:25,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:25,194 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:01:25,194 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:25,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:25,196 INFO L229 MonitoredProcess]: Starting monitored process 82 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-06 19:01:25,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-06 19:01:25,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:25,197 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:25,197 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:25,197 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:01:25,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-06 19:01:25,203 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:25,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:25,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:25,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:25,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:25,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,260 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-06 19:01:25,262 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:25,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 255 states and 317 transitions. Complement of second has 7 states. [2025-02-06 19:01:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-02-06 19:01:25,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:25,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:25,288 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:25,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:25,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:25,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:25,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,338 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-06 19:01:25,338 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:01:25,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 369 states and 449 transitions. Complement of second has 9 states. [2025-02-06 19:01:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2025-02-06 19:01:25,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:25,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:25,380 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:25,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:25,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:25,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:01:25,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:01:25,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,432 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-06 19:01:25,432 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 3 loop predicates [2025-02-06 19:01:25,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,452 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 320 states and 401 transitions. Complement of second has 8 states. [2025-02-06 19:01:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-02-06 19:01:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2025-02-06 19:01:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 6 letters. [2025-02-06 19:01:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2025-02-06 19:01:25,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:25,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 401 transitions. [2025-02-06 19:01:25,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2025-02-06 19:01:25,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 237 states and 299 transitions. [2025-02-06 19:01:25,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-06 19:01:25,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2025-02-06 19:01:25,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 299 transitions. [2025-02-06 19:01:25,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:25,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 237 states and 299 transitions. [2025-02-06 19:01:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 299 transitions. [2025-02-06 19:01:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 175. [2025-02-06 19:01:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 174 states have internal predecessors, (229), 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-06 19:01:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2025-02-06 19:01:25,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 229 transitions. [2025-02-06 19:01:25,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:25,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:01:25,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:01:25,461 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-06 19:01:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:25,527 INFO L93 Difference]: Finished difference Result 387 states and 490 transitions. [2025-02-06 19:01:25,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 490 transitions. [2025-02-06 19:01:25,529 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2025-02-06 19:01:25,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 371 states and 472 transitions. [2025-02-06 19:01:25,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-02-06 19:01:25,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-02-06 19:01:25,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 472 transitions. [2025-02-06 19:01:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:25,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 371 states and 472 transitions. [2025-02-06 19:01:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 472 transitions. [2025-02-06 19:01:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 305. [2025-02-06 19:01:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 305 states have (on average 1.2819672131147541) internal successors, (391), 304 states have internal predecessors, (391), 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-06 19:01:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 391 transitions. [2025-02-06 19:01:25,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 305 states and 391 transitions. [2025-02-06 19:01:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:01:25,537 INFO L432 stractBuchiCegarLoop]: Abstraction has 305 states and 391 transitions. [2025-02-06 19:01:25,537 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:01:25,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 391 transitions. [2025-02-06 19:01:25,538 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2025-02-06 19:01:25,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:25,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:25,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:01:25,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1] [2025-02-06 19:01:25,539 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:25,539 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -297785385, now seen corresponding path program 1 times [2025-02-06 19:01:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805028562] [2025-02-06 19:01:25,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:25,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:01:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:01:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,583 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-06 19:01:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805028562] [2025-02-06 19:01:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805028562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:25,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649714149] [2025-02-06 19:01:25,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:25,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:25,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:25,585 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:25,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-02-06 19:01:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:01:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:01:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,624 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-06 19:01:25,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:25,660 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-06 19:01:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649714149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:25,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 19:01:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940948905] [2025-02-06 19:01:25,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:25,660 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 865140173, now seen corresponding path program 1 times [2025-02-06 19:01:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204503647] [2025-02-06 19:01:25,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:25,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:01:25,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:01:25,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-02-06 19:01:25,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-02-06 19:01:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204503647] [2025-02-06 19:01:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204503647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999402141] [2025-02-06 19:01:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:25,816 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:25,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-02-06 19:01:25,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:01:25,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:01:25,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 19:01:25,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 19:01:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999402141] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:25,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-02-06 19:01:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123497149] [2025-02-06 19:01:25,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:25,892 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 19:01:25,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 19:01:25,892 INFO L87 Difference]: Start difference. First operand 305 states and 391 transitions. cyclomatic complexity: 104 Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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-06 19:01:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:26,063 INFO L93 Difference]: Finished difference Result 945 states and 1181 transitions. [2025-02-06 19:01:26,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1181 transitions. [2025-02-06 19:01:26,067 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2025-02-06 19:01:26,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 911 states and 1144 transitions. [2025-02-06 19:01:26,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-02-06 19:01:26,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-02-06 19:01:26,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 911 states and 1144 transitions. [2025-02-06 19:01:26,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:26,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 911 states and 1144 transitions. [2025-02-06 19:01:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states and 1144 transitions. [2025-02-06 19:01:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 549. [2025-02-06 19:01:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 549 states have (on average 1.2805100182149363) internal successors, (703), 548 states have internal predecessors, (703), 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-06 19:01:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 703 transitions. [2025-02-06 19:01:26,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 549 states and 703 transitions. [2025-02-06 19:01:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 19:01:26,079 INFO L432 stractBuchiCegarLoop]: Abstraction has 549 states and 703 transitions. [2025-02-06 19:01:26,079 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:01:26,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 549 states and 703 transitions. [2025-02-06 19:01:26,081 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-02-06 19:01:26,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:26,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:26,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1] [2025-02-06 19:01:26,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:26,082 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:26,082 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-02-06 19:01:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash -442875361, now seen corresponding path program 1 times [2025-02-06 19:01:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137233326] [2025-02-06 19:01:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:01:26,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:01:26,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 19:01:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137233326] [2025-02-06 19:01:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137233326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:01:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022625783] [2025-02-06 19:01:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:26,114 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1024486901, now seen corresponding path program 2 times [2025-02-06 19:01:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670912524] [2025-02-06 19:01:26,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:26,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:01:26,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:26,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:01:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:26,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:01:26,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:01:26,155 INFO L87 Difference]: Start difference. First operand 549 states and 703 transitions. cyclomatic complexity: 174 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:26,169 INFO L93 Difference]: Finished difference Result 537 states and 632 transitions. [2025-02-06 19:01:26,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 632 transitions. [2025-02-06 19:01:26,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-02-06 19:01:26,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 524 states and 614 transitions. [2025-02-06 19:01:26,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2025-02-06 19:01:26,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2025-02-06 19:01:26,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 614 transitions. [2025-02-06 19:01:26,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:26,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 524 states and 614 transitions. [2025-02-06 19:01:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 614 transitions. [2025-02-06 19:01:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2025-02-06 19:01:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 508 states have (on average 1.1771653543307086) internal successors, (598), 507 states have internal predecessors, (598), 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-06 19:01:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 598 transitions. [2025-02-06 19:01:26,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 508 states and 598 transitions. [2025-02-06 19:01:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:01:26,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 508 states and 598 transitions. [2025-02-06 19:01:26,181 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:01:26,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 598 transitions. [2025-02-06 19:01:26,182 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2025-02-06 19:01:26,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:26,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:26,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1] [2025-02-06 19:01:26,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:26,183 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:26,183 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 788320580, now seen corresponding path program 2 times [2025-02-06 19:01:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534516323] [2025-02-06 19:01:26,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-06 19:01:26,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:01:26,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:26,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:01:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534516323] [2025-02-06 19:01:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534516323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276251687] [2025-02-06 19:01:26,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:26,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:26,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:26,270 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:26,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-02-06 19:01:26,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-06 19:01:26,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:01:26,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:26,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:01:26,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 19:01:26,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:01:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276251687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:01:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-02-06 19:01:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925880678] [2025-02-06 19:01:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:26,360 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:26,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 3 times [2025-02-06 19:01:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155030316] [2025-02-06 19:01:26,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:01:26,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:01:26,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:01:26,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:26,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:26,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:01:26,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:01:26,414 INFO L87 Difference]: Start difference. First operand 508 states and 598 transitions. cyclomatic complexity: 110 Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-06 19:01:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:26,455 INFO L93 Difference]: Finished difference Result 654 states and 718 transitions. [2025-02-06 19:01:26,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 718 transitions. [2025-02-06 19:01:26,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 149 [2025-02-06 19:01:26,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 647 states and 711 transitions. [2025-02-06 19:01:26,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-02-06 19:01:26,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2025-02-06 19:01:26,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 711 transitions. [2025-02-06 19:01:26,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:26,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 647 states and 711 transitions. [2025-02-06 19:01:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 711 transitions. [2025-02-06 19:01:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 528. [2025-02-06 19:01:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.115530303030303) internal successors, (589), 527 states have internal predecessors, (589), 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-06 19:01:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 589 transitions. [2025-02-06 19:01:26,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 589 transitions. [2025-02-06 19:01:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:01:26,467 INFO L432 stractBuchiCegarLoop]: Abstraction has 528 states and 589 transitions. [2025-02-06 19:01:26,467 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:01:26,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 589 transitions. [2025-02-06 19:01:26,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2025-02-06 19:01:26,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:26,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:26,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2025-02-06 19:01:26,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:26,471 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:26,471 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash -930582142, now seen corresponding path program 3 times [2025-02-06 19:01:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758506828] [2025-02-06 19:01:26,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-02-06 19:01:26,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 34 of 40 statements. [2025-02-06 19:01:26,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:01:26,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:01:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758506828] [2025-02-06 19:01:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758506828] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072555557] [2025-02-06 19:01:26,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:26,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:26,536 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:26,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-02-06 19:01:26,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-02-06 19:01:26,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 34 of 40 statements. [2025-02-06 19:01:26,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:01:26,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:26,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:01:26,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:01:26,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:01:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072555557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:26,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 19:01:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172754688] [2025-02-06 19:01:26,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:26,697 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 4 times [2025-02-06 19:01:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359324503] [2025-02-06 19:01:26,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:01:26,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:26,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:01:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:26,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:26,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 19:01:26,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-02-06 19:01:26,747 INFO L87 Difference]: Start difference. First operand 528 states and 589 transitions. cyclomatic complexity: 83 Second operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 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-06 19:01:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:27,184 INFO L93 Difference]: Finished difference Result 2579 states and 2728 transitions. [2025-02-06 19:01:27,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2579 states and 2728 transitions. [2025-02-06 19:01:27,194 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 382 [2025-02-06 19:01:27,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2579 states to 2419 states and 2568 transitions. [2025-02-06 19:01:27,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 790 [2025-02-06 19:01:27,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2025-02-06 19:01:27,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2419 states and 2568 transitions. [2025-02-06 19:01:27,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:27,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2419 states and 2568 transitions. [2025-02-06 19:01:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states and 2568 transitions. [2025-02-06 19:01:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1966. [2025-02-06 19:01:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1966 states have (on average 1.0712105798575788) internal successors, (2106), 1965 states have internal predecessors, (2106), 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-06 19:01:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2106 transitions. [2025-02-06 19:01:27,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1966 states and 2106 transitions. [2025-02-06 19:01:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 19:01:27,225 INFO L432 stractBuchiCegarLoop]: Abstraction has 1966 states and 2106 transitions. [2025-02-06 19:01:27,225 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:01:27,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1966 states and 2106 transitions. [2025-02-06 19:01:27,232 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 274 [2025-02-06 19:01:27,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:27,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:27,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2025-02-06 19:01:27,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:27,233 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:27,233 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:27,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2076807644, now seen corresponding path program 4 times [2025-02-06 19:01:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101385968] [2025-02-06 19:01:27,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:27,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-06 19:01:27,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:01:27,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101385968] [2025-02-06 19:01:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101385968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124983174] [2025-02-06 19:01:27,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:27,462 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:27,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-02-06 19:01:27,480 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-06 19:01:27,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:01:27,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:27,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:27,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:01:27,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:27,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124983174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:27,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-02-06 19:01:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744882441] [2025-02-06 19:01:27,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:27,833 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 5 times [2025-02-06 19:01:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152190046] [2025-02-06 19:01:27,833 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:27,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:01:27,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:27,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:27,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:01:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:27,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:27,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:27,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:27,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:01:27,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:01:27,876 INFO L87 Difference]: Start difference. First operand 1966 states and 2106 transitions. cyclomatic complexity: 191 Second operand has 24 states, 23 states have (on average 5.391304347826087) internal successors, (124), 24 states have internal predecessors, (124), 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-06 19:01:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:28,518 INFO L93 Difference]: Finished difference Result 9799 states and 10275 transitions. [2025-02-06 19:01:28,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9799 states and 10275 transitions. [2025-02-06 19:01:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1755 [2025-02-06 19:01:28,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9799 states to 9523 states and 9999 transitions. [2025-02-06 19:01:28,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3891 [2025-02-06 19:01:28,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3891 [2025-02-06 19:01:28,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9523 states and 9999 transitions. [2025-02-06 19:01:28,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:28,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9523 states and 9999 transitions. [2025-02-06 19:01:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states and 9999 transitions. [2025-02-06 19:01:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 3790. [2025-02-06 19:01:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3790 states have (on average 1.05910290237467) internal successors, (4014), 3789 states have internal predecessors, (4014), 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-06 19:01:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4014 transitions. [2025-02-06 19:01:28,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3790 states and 4014 transitions. [2025-02-06 19:01:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-06 19:01:28,650 INFO L432 stractBuchiCegarLoop]: Abstraction has 3790 states and 4014 transitions. [2025-02-06 19:01:28,650 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:01:28,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3790 states and 4014 transitions. [2025-02-06 19:01:28,655 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 748 [2025-02-06 19:01:28,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:28,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:28,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2025-02-06 19:01:28,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:28,656 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:28,657 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-06 19:01:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash -396693252, now seen corresponding path program 5 times [2025-02-06 19:01:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784081678] [2025-02-06 19:01:28,657 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:28,661 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 124 statements into 21 equivalence classes. [2025-02-06 19:01:28,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:01:28,672 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-02-06 19:01:28,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:28,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 19:01:28,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:01:28,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 6 times [2025-02-06 19:01:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435393208] [2025-02-06 19:01:28,685 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:28,689 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:01:28,690 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:28,691 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 19:01:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:28,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:01:28,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:01:28,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:28,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 192008498, now seen corresponding path program 1 times [2025-02-06 19:01:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300727010] [2025-02-06 19:01:28,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:28,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 19:01:28,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 19:01:28,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:28,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 19:01:28,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 19:01:28,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:29,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 19:01:29,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:01:29,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:29,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:29,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:29,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 19:01:29,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:01:29,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:29,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:29,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:01:29 BoogieIcfgContainer [2025-02-06 19:01:29,554 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:01:29,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:01:29,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:01:29,555 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:01:29,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:20" (3/4) ... [2025-02-06 19:01:29,557 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:01:29,619 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:01:29,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:01:29,620 INFO L158 Benchmark]: Toolchain (without parser) took 9911.79ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.4MB in the beginning and 136.2MB in the end (delta: 19.2MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,620 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.99ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 145.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.07ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 144.4MB in the end (delta: 748.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,621 INFO L158 Benchmark]: Boogie Preprocessor took 15.09ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,621 INFO L158 Benchmark]: IcfgBuilder took 175.97ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 133.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,621 INFO L158 Benchmark]: BuchiAutomizer took 9493.89ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 133.4MB in the beginning and 142.2MB in the end (delta: -8.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,622 INFO L158 Benchmark]: Witness Printer took 64.99ms. Allocated memory is still 243.3MB. Free memory was 142.2MB in the beginning and 136.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,623 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.43ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.99ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 145.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.07ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 144.4MB in the end (delta: 748.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.09ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 175.97ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 133.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9493.89ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 133.4MB in the beginning and 142.2MB in the end (delta: -8.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 64.99ms. Allocated memory is still 243.3MB. Free memory was 142.2MB in the beginning and 136.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. 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 18 terminating modules (13 trivial, 4 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. 13 modules have a trivial ranking function, the largest among these consists of 24 locations. The remainder module has 3790 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 16 iterations. TraceHistogramMax:21. Analysis of lassos took 6.7s. Construction of modules took 0.6s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6929 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 792 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 220 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc2 concLT1 SILN4 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax143 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp72 dnf138 smp87 tf108 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=20, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=20, range=20, up=0] [L17] COND TRUE i == range [L18] up = 0 VAL [i=20, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=20, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=19, range=20, up=0] [L26] COND FALSE !(i == range-2) VAL [i=19, range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=20, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=20, range=20, up=0] [L17] COND TRUE i == range [L18] up = 0 VAL [i=20, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=20, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=19, range=20, up=0] [L26] COND FALSE !(i == range-2) VAL [i=19, range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:01:29,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:29,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:30,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:30,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-02-06 19:01:30,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-02-06 19:01:30,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-02-06 19:01:30,840 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)