./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 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/NO_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:02:25,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:02:25,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:02:25,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:02:25,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:02:25,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:02:25,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:02:25,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:02:25,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:02:25,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:02:25,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:02:25,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:02:25,725 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:02:25,726 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:02:25,727 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:02:25,727 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:02:25,727 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:02:25,727 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:02:25,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:02:25,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:02:25,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:02:25,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:02:25,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:02:25,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:02:25,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:02:25,730 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:02:25,730 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2025-01-10 07:02:25,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:02:25,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:02:25,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:02:25,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:02:25,974 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:02:25,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2025-01-10 07:02:27,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9361004f6/91164354ba1c41df85ab933092b218c3/FLAG23b3054af [2025-01-10 07:02:27,359 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:02:27,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2025-01-10 07:02:27,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9361004f6/91164354ba1c41df85ab933092b218c3/FLAG23b3054af [2025-01-10 07:02:27,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9361004f6/91164354ba1c41df85ab933092b218c3 [2025-01-10 07:02:27,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:02:27,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:02:27,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:27,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:02:27,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:02:27,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0f8cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27, skipping insertion in model container [2025-01-10 07:02:27,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:02:27,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:27,825 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:02:27,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:27,841 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:02:27,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27 WrapperNode [2025-01-10 07:02:27,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:27,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:27,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:02:27,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:02:27,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,861 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2025-01-10 07:02:27,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:27,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:02:27,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:02:27,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:02:27,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,872 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:02:27,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:02:27,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:02:27,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:02:27,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:02:27,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (1/1) ... [2025-01-10 07:02:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:27,909 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-01-10 07:02:27,911 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-01-10 07:02:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:02:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:02:27,972 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:02:27,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:02:28,005 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-01-10 07:02:28,005 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:02:28,011 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:02:28,013 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:02:28,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:28 BoogieIcfgContainer [2025-01-10 07:02:28,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:02:28,015 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:02:28,015 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:02:28,018 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:02:28,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:28,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:02:27" (1/3) ... [2025-01-10 07:02:28,019 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ce03dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:28, skipping insertion in model container [2025-01-10 07:02:28,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:28,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:27" (2/3) ... [2025-01-10 07:02:28,020 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ce03dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:28, skipping insertion in model container [2025-01-10 07:02:28,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:28,020 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:28" (3/3) ... [2025-01-10 07:02:28,021 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2025-01-10 07:02:28,055 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:02:28,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:02:28,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:02:28,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:02:28,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:02:28,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:02:28,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:02:28,057 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:02:28,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:28,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:28,072 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:02:28,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:28,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:28,078 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" [2025-01-10 07:02:28,078 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-01-10 07:02:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:02:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380340549] [2025-01-10 07:02:28,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 1 times [2025-01-10 07:02:28,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291084113] [2025-01-10 07:02:28,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 07:02:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908852104] [2025-01-10 07:02:28,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:28,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:28,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:28,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:28,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,230 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,231 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:28,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-01-10 07:02:28,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,232 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,299 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:28,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,303 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-01-10 07:02:28,304 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-01-10 07:02:28,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,328 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,328 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:28,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,337 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-01-10 07:02:28,337 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-01-10 07:02:28,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,357 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,358 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:28,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,365 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-01-10 07:02:28,366 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-01-10 07:02:28,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,387 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-01-10 07:02:28,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,390 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-01-10 07:02:28,392 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-01-10 07:02:28,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:28,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,422 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:28,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,426 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,426 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,426 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,426 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,426 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:28,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,426 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-01-10 07:02:28,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,426 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,484 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,487 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,490 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-01-10 07:02:28,491 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-01-10 07:02:28,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-01-10 07:02:28,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:28,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:28,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:28,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,520 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-01-10 07:02:28,521 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-01-10 07:02:28,523 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-01-10 07:02:28,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:28,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:28,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:28,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,553 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-01-10 07:02:28,555 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-01-10 07:02:28,556 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-01-10 07:02:28,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:28,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:28,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:28,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:28,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:28,575 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:28,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,577 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-01-10 07:02:28,579 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-01-10 07:02:28,580 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:28,580 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:28,580 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:28,581 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-01-10 07:02:28,586 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-01-10 07:02:28,589 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,659 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:28,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2025-01-10 07:02:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 07:02:28,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:02:28,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:28,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 07:02:28,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:28,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-01-10 07:02:28,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:28,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:02:28,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:28,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:02:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-01-10 07:02:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 07:02:28,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,717 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:28,717 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:02:28,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-01-10 07:02:28,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:28,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:02:28,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:28,718 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-01-10 07:02:28,718 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-01-10 07:02:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 07:02:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883980508] [2025-01-10 07:02:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:28,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:28,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883980508] [2025-01-10 07:02:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883980508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:02:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:02:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485637684] [2025-01-10 07:02:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:28,754 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 2 times [2025-01-10 07:02:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663334204] [2025-01-10 07:02:28,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:28,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:28,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,776 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,776 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,776 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,776 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,776 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:28,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-01-10 07:02:28,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,777 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,812 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,814 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-01-10 07:02:28,815 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-01-10 07:02:28,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,835 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,835 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-01-10 07:02:28,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,842 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-01-10 07:02:28,843 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-01-10 07:02:28,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,861 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:28,861 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-01-10 07:02:28,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:02:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,868 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-01-10 07:02:28,869 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-01-10 07:02:28,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:28,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,890 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-01-10 07:02:28,890 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-01-10 07:02:28,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:28,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:28,913 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-01-10 07:02:28,918 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-01-10 07:02:28,924 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:28,928 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-01-10 07:02:28,928 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:28,928 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:28,928 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:28,928 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:28,928 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:28,928 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,928 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:28,928 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:28,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-01-10 07:02:28,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:28,928 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:28,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:28,975 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:28,975 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:28,978 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-01-10 07:02:28,979 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-01-10 07:02:28,980 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-01-10 07:02:28,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:28,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:28,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:28,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:28,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:28,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:28,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:29,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,008 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-01-10 07:02:29,009 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-01-10 07:02:29,010 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-01-10 07:02:29,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:29,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:29,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:29,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,035 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-01-10 07:02:29,036 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-01-10 07:02:29,037 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-01-10 07:02:29,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:29,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:29,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:29,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:29,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:29,052 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,054 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-01-10 07:02:29,055 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-01-10 07:02:29,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:29,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:29,057 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:29,057 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-01-10 07:02:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,064 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:29,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,103 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 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-01-10 07:02:29,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. 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) Result 12 states and 17 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. 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-01-10 07:02:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:29,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:29,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:29,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 07:02:29,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:29,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:29,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:29,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:02:29,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:29,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-01-10 07:02:29,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-01-10 07:02:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:02:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:29,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:29,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:02:29,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:02:29,122 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:29,130 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-01-10 07:02:29,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-01-10 07:02:29,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:29,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2025-01-10 07:02:29,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:02:29,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:29,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-01-10 07:02:29,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:02:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-01-10 07:02:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-10 07:02:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-10 07:02:29,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:02:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:02:29,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:02:29,134 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:02:29,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-01-10 07:02:29,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:29,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:29,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:29,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2025-01-10 07:02:29,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:29,134 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-01-10 07:02:29,134 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-01-10 07:02:29,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 147829008, now seen corresponding path program 1 times [2025-01-10 07:02:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279065001] [2025-01-10 07:02:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279065001] [2025-01-10 07:02:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279065001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769830417] [2025-01-10 07:02:29,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,190 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 07:02:29,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769830417] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:29,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-10 07:02:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315656465] [2025-01-10 07:02:29,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:29,248 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 3 times [2025-01-10 07:02:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832777257] [2025-01-10 07:02:29,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:02:29,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,268 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,268 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:29,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,269 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,269 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,269 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-01-10 07:02:29,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,269 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,300 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:29,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,320 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-01-10 07:02:29,322 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-01-10 07:02:29,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,339 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-01-10 07:02:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,341 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-01-10 07:02:29,342 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-01-10 07:02:29,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:29,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,364 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:29,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,369 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,369 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,369 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,369 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,369 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:29,369 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,369 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,369 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,369 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-01-10 07:02:29,369 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,369 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,413 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,413 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,417 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-01-10 07:02:29,419 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-01-10 07:02:29,420 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-01-10 07:02:29,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:29,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:29,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:29,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:29,435 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:29,435 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,437 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-01-10 07:02:29,438 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-01-10 07:02:29,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:29,439 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:29,439 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:29,439 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-01-10 07:02:29,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,445 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:29,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,473 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14 states and 20 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:29,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,480 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,514 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,520 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14 states and 20 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:29,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,522 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:29,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:29,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,556 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:02:29,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 16 states and 23 transitions. Complement of second has 4 states. [2025-01-10 07:02:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-01-10 07:02:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:29,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:29,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2025-01-10 07:02:29,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2025-01-10 07:02:29,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-01-10 07:02:29,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2025-01-10 07:02:29,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:02:29,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:29,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-01-10 07:02:29,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-01-10 07:02:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-01-10 07:02:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2025-01-10 07:02:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-01-10 07:02:29,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-01-10 07:02:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:29,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:02:29,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:02:29,570 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:29,589 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-01-10 07:02:29,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-01-10 07:02:29,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2025-01-10 07:02:29,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:29,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:02:29,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-01-10 07:02:29,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:29,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:02:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-01-10 07:02:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-01-10 07:02:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-10 07:02:29,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:02:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:02:29,593 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:02:29,593 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:02:29,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-01-10 07:02:29,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:29,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:29,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:29,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1] [2025-01-10 07:02:29,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:29,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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:29,595 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1575187095, now seen corresponding path program 2 times [2025-01-10 07:02:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272896522] [2025-01-10 07:02:29,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:02:29,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:29,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:29,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:29,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1308, now seen corresponding path program 1 times [2025-01-10 07:02:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827462865] [2025-01-10 07:02:29,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:29,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:29,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:29,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:29,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1926310450, now seen corresponding path program 2 times [2025-01-10 07:02:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014097235] [2025-01-10 07:02:29,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:29,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:02:29,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:29,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014097235] [2025-01-10 07:02:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014097235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232998993] [2025-01-10 07:02:29,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,672 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 07:02:29,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:02:29,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:29,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:29,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232998993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:29,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-10 07:02:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437843758] [2025-01-10 07:02:29,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:29,793 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:29,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-01-10 07:02:29,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,831 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,831 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:29,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,833 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-01-10 07:02:29,834 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-01-10 07:02:29,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,854 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:29,854 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:29,859 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-01-10 07:02:29,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,861 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-01-10 07:02:29,862 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-01-10 07:02:29,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,880 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:29,881 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:29,886 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-01-10 07:02:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,888 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-01-10 07:02:29,890 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-01-10 07:02:29,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:29,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,911 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-01-10 07:02:29,912 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-01-10 07:02:29,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:29,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,936 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:29,940 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-01-10 07:02:29,940 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:29,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-01-10 07:02:29,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,940 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,987 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,987 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:29,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,990 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-01-10 07:02:29,992 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-01-10 07:02:29,993 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-01-10 07:02:30,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:30,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:30,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:30,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:30,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:30,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:30,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:30,012 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-01-10 07:02:30,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:30,014 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-01-10 07:02:30,015 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-01-10 07:02:30,016 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-01-10 07:02:30,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:30,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:30,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:30,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:30,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:30,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:30,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:30,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:02:30,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:30,037 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-01-10 07:02:30,039 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-01-10 07:02:30,054 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-01-10 07:02:30,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:02:30,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:02:30,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:30,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:30,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:30,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:30,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:30,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:30,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:30,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:30,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:30,072 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:30,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:30,073 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-01-10 07:02:30,074 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-01-10 07:02:30,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:30,075 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:30,075 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:30,075 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-01-10 07:02:30,080 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-01-10 07:02:30,081 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:30,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:30,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:30,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:30,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:30,138 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:30,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 15 transitions. Complement of second has 3 states. [2025-01-10 07:02:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:02:30,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:30,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,143 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:30,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:30,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:30,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:30,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:30,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:30,192 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:30,192 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 15 transitions. Complement of second has 3 states. [2025-01-10 07:02:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:02:30,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:30,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,202 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:30,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:30,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:30,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:30,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:30,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:30,246 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:30,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2025-01-10 07:02:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:02:30,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:02:30,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2025-01-10 07:02:30,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2025-01-10 07:02:30,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-01-10 07:02:30,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:02:30,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2025-01-10 07:02:30,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-01-10 07:02:30,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 07:02:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-01-10 07:02:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 07:02:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-01-10 07:02:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 07:02:30,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:02:30,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:30,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 07:02:30,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 07:02:30,260 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-01-10 07:02:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:30,292 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-01-10 07:02:30,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2025-01-10 07:02:30,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 29 transitions. [2025-01-10 07:02:30,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2025-01-10 07:02:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 07:02:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2025-01-10 07:02:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-01-10 07:02:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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-01-10 07:02:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-10 07:02:30,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-10 07:02:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:02:30,297 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-10 07:02:30,298 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:02:30,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2025-01-10 07:02:30,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:30,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:30,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1] [2025-01-10 07:02:30,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:30,299 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:30,300 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:30,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1885351429, now seen corresponding path program 3 times [2025-01-10 07:02:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707586316] [2025-01-10 07:02:30,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-01-10 07:02:30,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:02:30,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:02:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:02:30,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:02:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 1 times [2025-01-10 07:02:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115062505] [2025-01-10 07:02:30,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash -924533955, now seen corresponding path program 3 times [2025-01-10 07:02:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545606344] [2025-01-10 07:02:30,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-01-10 07:02:30,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:02:30,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 07:02:30,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545606344] [2025-01-10 07:02:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545606344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072300802] [2025-01-10 07:02:30,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:30,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:30,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:30,499 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:30,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-10 07:02:30,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-01-10 07:02:30,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:02:30,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 07:02:30,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072300802] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:30,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-01-10 07:02:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815538530] [2025-01-10 07:02:30,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:30,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 07:02:30,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 07:02:30,758 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 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-01-10 07:02:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:30,810 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-01-10 07:02:30,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2025-01-10 07:02:30,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2025-01-10 07:02:30,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:30,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:30,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2025-01-10 07:02:30,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:30,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-01-10 07:02:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2025-01-10 07:02:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-01-10 07:02:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 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-01-10 07:02:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-01-10 07:02:30,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-10 07:02:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:02:30,814 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-10 07:02:30,814 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:02:30,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2025-01-10 07:02:30,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:30,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:30,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:30,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1] [2025-01-10 07:02:30,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:30,815 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:30,815 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1315309025, now seen corresponding path program 4 times [2025-01-10 07:02:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700850109] [2025-01-10 07:02:30,815 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,823 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-01-10 07:02:30,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:02:30,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:02:30,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:02:30,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,852 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-01-10 07:02:30,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 2 times [2025-01-10 07:02:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364935397] [2025-01-10 07:02:30,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:30,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:30,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:30,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:30,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:30,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:30,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:30,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash -29145831, now seen corresponding path program 4 times [2025-01-10 07:02:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150277242] [2025-01-10 07:02:30,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:30,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-10 07:02:30,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:02:30,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:30,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150277242] [2025-01-10 07:02:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150277242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456754869] [2025-01-10 07:02:31,260 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:31,262 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:31,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-10 07:02:31,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-10 07:02:31,293 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:02:31,293 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:31,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:31,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:02:31,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:31,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456754869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:32,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-01-10 07:02:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78238333] [2025-01-10 07:02:32,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:32,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 07:02:32,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 07:02:32,038 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 48 states have internal predecessors, (97), 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-01-10 07:02:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:32,150 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2025-01-10 07:02:32,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2025-01-10 07:02:32,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:32,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2025-01-10 07:02:32,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:32,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:32,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2025-01-10 07:02:32,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:32,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2025-01-10 07:02:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2025-01-10 07:02:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-10 07:02:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 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-01-10 07:02:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-01-10 07:02:32,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-01-10 07:02:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:02:32,156 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-01-10 07:02:32,156 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:02:32,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2025-01-10 07:02:32,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:32,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:32,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:32,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1] [2025-01-10 07:02:32,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:32,159 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:32,159 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:32,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -499828327, now seen corresponding path program 5 times [2025-01-10 07:02:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091306264] [2025-01-10 07:02:32,160 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,165 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 47 equivalence classes. [2025-01-10 07:02:32,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 07:02:32,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 07:02:32,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:32,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 07:02:32,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 07:02:32,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:32,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:32,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 3 times [2025-01-10 07:02:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884368199] [2025-01-10 07:02:32,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:32,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:32,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 07:02:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:32,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:32,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:32,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:32,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:32,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -345908015, now seen corresponding path program 5 times [2025-01-10 07:02:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143892359] [2025-01-10 07:02:32,227 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:32,230 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-01-10 07:02:32,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 07:02:32,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-01-10 07:02:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143892359] [2025-01-10 07:02:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143892359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147136480] [2025-01-10 07:02:33,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:33,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:33,459 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:02:33,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-01-10 07:02:33,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-01-10 07:02:33,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 07:02:33,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-01-10 07:02:33,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:33,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:02:33,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:33,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:02:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147136480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:34,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2025-01-10 07:02:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457452570] [2025-01-10 07:02:34,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-10 07:02:34,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-01-10 07:02:34,664 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 52 states have internal predecessors, (106), 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-01-10 07:02:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:34,773 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2025-01-10 07:02:34,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2025-01-10 07:02:34,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:34,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2025-01-10 07:02:34,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:34,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:34,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2025-01-10 07:02:34,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:34,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2025-01-10 07:02:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2025-01-10 07:02:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-10 07:02:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 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-01-10 07:02:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2025-01-10 07:02:34,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-01-10 07:02:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-10 07:02:34,783 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-01-10 07:02:34,783 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:02:34,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2025-01-10 07:02:34,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:34,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:34,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:34,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 50, 1, 1] [2025-01-10 07:02:34,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:34,787 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:34,787 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-01-10 07:02:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1428758131, now seen corresponding path program 6 times [2025-01-10 07:02:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650423899] [2025-01-10 07:02:34,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:34,793 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 51 equivalence classes. [2025-01-10 07:02:34,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 07:02:34,805 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-01-10 07:02:34,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:34,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 07:02:34,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 07:02:34,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 4 times [2025-01-10 07:02:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655049207] [2025-01-10 07:02:34,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:34,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:02:34,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:34,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:34,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:34,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:34,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:34,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:34,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1169790267, now seen corresponding path program 6 times [2025-01-10 07:02:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532557444] [2025-01-10 07:02:34,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:34,823 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 107 statements into 53 equivalence classes. [2025-01-10 07:02:34,833 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 07:02:34,833 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2025-01-10 07:02:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:34,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 07:02:34,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 07:02:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:34,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:35,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 07:02:35,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 07:02:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:35,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 07:02:35,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 07:02:35,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:35,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:35,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:02:35 BoogieIcfgContainer [2025-01-10 07:02:35,971 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:02:35,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:02:35,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:02:35,972 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:02:35,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:28" (3/4) ... [2025-01-10 07:02:35,974 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:02:36,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:02:36,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:02:36,019 INFO L158 Benchmark]: Toolchain (without parser) took 8302.66ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 112.7MB in the beginning and 137.5MB in the end (delta: -24.8MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2025-01-10 07:02:36,019 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:36,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 126.78ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:36,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.35ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.9MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:36,019 INFO L158 Benchmark]: Boogie Preprocessor took 17.37ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 905.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:36,020 INFO L158 Benchmark]: RCFGBuilder took 134.07ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 92.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:36,020 INFO L158 Benchmark]: BuchiAutomizer took 7956.69ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 92.7MB in the beginning and 141.5MB in the end (delta: -48.8MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2025-01-10 07:02:36,020 INFO L158 Benchmark]: Witness Printer took 46.47ms. Allocated memory is still 276.8MB. Free memory was 141.5MB in the beginning and 137.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:36,021 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.74ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 126.78ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.35ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.9MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.37ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 905.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 134.07ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 92.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7956.69ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 92.7MB in the beginning and 141.5MB in the end (delta: -48.8MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 46.47ms. Allocated memory is still 276.8MB. Free memory was 141.5MB in the beginning and 137.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 6.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 333 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 51 mSDtfsCounter, 333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax213 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:02:36,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-01-10 07:02:36,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:36,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:36,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-10 07:02:36,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 07:02:37,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)