./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.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 eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:01:13,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:01:13,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:01:13,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:01:13,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:01:13,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:01:13,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:01:13,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:01:13,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:01:13,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:01:13,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:01:13,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:01:13,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:01:13,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:01:13,623 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:01:13,623 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:01:13,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:01:13,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:01:13,625 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:01:13,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:01:13,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:01:13,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:01:13,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:01:13,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:01:13,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:01:13,627 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:01:13,627 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 -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2025-02-06 19:01:13,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:01:13,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:01:13,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:01:13,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:01:13,952 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:01:13,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2025-02-06 19:01:15,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbed23/f216b23835f448b8b9c2ddacf34fb0f6/FLAGc818434fb [2025-02-06 19:01:15,590 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:01:15,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2025-02-06 19:01:15,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbed23/f216b23835f448b8b9c2ddacf34fb0f6/FLAGc818434fb [2025-02-06 19:01:15,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc6fbed23/f216b23835f448b8b9c2ddacf34fb0f6 [2025-02-06 19:01:15,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:01:15,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:01:15,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:15,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:01:15,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:01:15,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415ef614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15, skipping insertion in model container [2025-02-06 19:01:15,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:01:15,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:15,772 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:01:15,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:01:15,794 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:01:15,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15 WrapperNode [2025-02-06 19:01:15,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:01:15,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:15,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:01:15,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:01:15,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,813 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-02-06 19:01:15,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:01:15,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:01:15,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:01:15,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:01:15,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,825 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 19:01:15,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:01:15,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:01:15,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:01:15,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:01:15,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (1/1) ... [2025-02-06 19:01:15,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:15,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:15,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:01:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:01:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:01:15,941 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:01:15,943 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:01:15,997 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-06 19:01:15,997 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:01:16,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:01:16,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:01:16,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:16 BoogieIcfgContainer [2025-02-06 19:01:16,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:01:16,005 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:01:16,005 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:01:16,009 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:01:16,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:16,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:01:15" (1/3) ... [2025-02-06 19:01:16,011 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e98016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:16, skipping insertion in model container [2025-02-06 19:01:16,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:16,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:01:15" (2/3) ... [2025-02-06 19:01:16,012 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e98016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:01:16, skipping insertion in model container [2025-02-06 19:01:16,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:01:16,012 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:16" (3/3) ... [2025-02-06 19:01:16,014 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2025-02-06 19:01:16,056 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:01:16,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:01:16,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:01:16,057 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:01:16,057 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:01:16,057 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:01:16,057 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:01:16,057 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:01:16,061 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-02-06 19:01:16,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:16,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:16,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:16,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:16,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:01:16,078 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:01:16,078 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-02-06 19:01:16,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:16,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:16,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:16,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:01:16,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:01:16,085 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" [2025-02-06 19:01:16,086 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-02-06 19:01:16,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-02-06 19:01:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:16,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751057840] [2025-02-06 19:01:16,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-02-06 19:01:16,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766983108] [2025-02-06 19:01:16,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:16,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:16,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:16,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1137982, now seen corresponding path program 1 times [2025-02-06 19:01:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719211821] [2025-02-06 19:01:16,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:16,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:16,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:16,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:16,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:16,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:16,329 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:16,330 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:16,330 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:16,330 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:16,331 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:16,331 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,331 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:16,331 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:16,331 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2025-02-06 19:01:16,331 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:16,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:16,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,461 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:16,462 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:01:16,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:16,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:16,493 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:16,493 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-02-06 19:01:16,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:01:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:01:16,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:16,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:16,529 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:16,529 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-02-06 19:01:16,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:01:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:01:16,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:16,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:16,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:01:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:01:16,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:16,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:16,601 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:16,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:01:16,606 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:16,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:16,606 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:16,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:16,606 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:16,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:16,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:16,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2025-02-06 19:01:16,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:16,606 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:16,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:16,702 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:16,706 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:16,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:01:16,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:16,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:16,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:16,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:16,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:16,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:16,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:16,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:16,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:01:16,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:16,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:16,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:16,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:16,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:16,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:16,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:16,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:16,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:01:16,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:01:16,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:16,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:16,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:16,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:16,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:16,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:16,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:16,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:16,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:16,812 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:16,816 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:16,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:16,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:01:16,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:16,821 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:16,821 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:16,822 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-02-06 19:01:16,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:01:16,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:16,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:16,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:16,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:16,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:16,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:16,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:16,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:16,905 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:01:16,906 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-02-06 19:01:16,938 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-02-06 19:01:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:16,943 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-02-06 19:01:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-02-06 19:01:16,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-06 19:01:16,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:16,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-06 19:01:16,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:16,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-06 19:01:16,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:16,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-02-06 19:01:16,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:16,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-02-06 19:01:16,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-02-06 19:01:16,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-06 19:01:16,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-02-06 19:01:16,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:16,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-06 19:01:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-02-06 19:01:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-06 19:01:16,979 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-02-06 19:01:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-02-06 19:01:16,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-06 19:01:16,980 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-06 19:01:16,980 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:01:16,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-02-06 19:01:16,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:16,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:16,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:16,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:01:16,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:01:16,981 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-02-06 19:01:16,981 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-02-06 19:01:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 1 times [2025-02-06 19:01:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244362306] [2025-02-06 19:01:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244362306] [2025-02-06 19:01:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244362306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:01:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:01:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:01:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945441407] [2025-02-06 19:01:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:01:17,049 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 2 times [2025-02-06 19:01:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733352171] [2025-02-06 19:01:17,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:17,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:17,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:17,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:01:17,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:17,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:17,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:17,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:17,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:17,115 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:17,116 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:17,116 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:17,116 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:17,116 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:17,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:17,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:17,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2025-02-06 19:01:17,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:17,117 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:17,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,197 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:17,198 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:17,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:01:17,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:17,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,251 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:17,251 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:17,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 19:01:17,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:01:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:01:17,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:17,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,289 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-02-06 19:01:17,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:01:17,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:17,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,323 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:17,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:01:17,327 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:17,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:17,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:17,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:17,327 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:17,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:17,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:17,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2025-02-06 19:01:17,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:17,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:17,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,406 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:17,406 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:17,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,409 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:01:17,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:17,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:17,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:17,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:17,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:17,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:17,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:17,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:17,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,440 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:01:17,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:17,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:17,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:17,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:17,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:17,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:17,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:17,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:17,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:17,465 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:17,466 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,468 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:01:17,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:17,471 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:17,471 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:17,472 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-02-06 19:01:17,479 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-02-06 19:01:17,481 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:17,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:17,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:17,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:17,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:17,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:17,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:17,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:17,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:17,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:01:17,528 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-02-06 19:01:17,538 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-02-06 19:01:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:17,539 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-02-06 19:01:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-06 19:01:17,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-06 19:01:17,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:17,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-06 19:01:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:17,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-06 19:01:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:17,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-02-06 19:01:17,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:17,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-02-06 19:01:17,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-06 19:01:17,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:01:17,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-02-06 19:01:17,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:17,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-06 19:01:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-02-06 19:01:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-06 19:01:17,543 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-02-06 19:01:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-02-06 19:01:17,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-06 19:01:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:17,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:01:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:01:17,546 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-02-06 19:01:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:17,555 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-02-06 19:01:17,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-02-06 19:01:17,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:17,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2025-02-06 19:01:17,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:01:17,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:01:17,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-02-06 19:01:17,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:17,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:01:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-02-06 19:01:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-06 19:01:17,557 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-02-06 19:01:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-02-06 19:01:17,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-06 19:01:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:01:17,559 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-06 19:01:17,559 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:01:17,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-02-06 19:01:17,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:01:17,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:17,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:17,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2025-02-06 19:01:17,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:01:17,560 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-02-06 19:01:17,560 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2025-02-06 19:01:17,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1316559940, now seen corresponding path program 1 times [2025-02-06 19:01:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985587624] [2025-02-06 19:01:17,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:17,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:17,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:17,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:17,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985587624] [2025-02-06 19:01:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985587624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740770825] [2025-02-06 19:01:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:17,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,629 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 19:01:17,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:17,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:17,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:17,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:01:17,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:17,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740770825] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:17,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 19:01:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16689581] [2025-02-06 19:01:17,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:17,722 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 3 times [2025-02-06 19:01:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817763791] [2025-02-06 19:01:17,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:17,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:17,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:17,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:01:17,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:17,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:17,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:17,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:17,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:17,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:17,772 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:17,772 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:17,772 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:17,772 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:17,772 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:17,772 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,772 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:17,772 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:17,772 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2025-02-06 19:01:17,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:17,773 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:17,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,852 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:17,853 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:17,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,857 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:01:17,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:17,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,882 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:17,883 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:17,889 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-02-06 19:01:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,891 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:01:17,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:17,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:01:17,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:17,914 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:17,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:01:17,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:17,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:17,947 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:17,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:01:17,953 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:17,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:17,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:17,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:17,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:17,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:17,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:17,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:17,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2025-02-06 19:01:17,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:17,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:17,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:17,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:18,021 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:18,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,024 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:01:18,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:18,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:18,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:18,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:18,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:18,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:01:18,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:01:18,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:18,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:01:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,057 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:01:18,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:18,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:18,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:18,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:18,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:18,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:18,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:18,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:18,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:18,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:18,080 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:01:18,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,083 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:01:18,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:18,086 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:18,086 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:18,086 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-02-06 19:01:18,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:01:18,094 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:18,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,143 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:01:18,143 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-02-06 19:01:18,152 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-02-06 19:01:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:18,153 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-02-06 19:01:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-06 19:01:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-06 19:01:18,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,153 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:18,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:18,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,202 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:01:18,202 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-02-06 19:01:18,213 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-02-06 19:01:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:18,215 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-02-06 19:01:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-06 19:01:18,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-06 19:01:18,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,216 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:01:18,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:01:18,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,258 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,261 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:01:18,262 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-02-06 19:01:18,272 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-02-06 19:01:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:18,273 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-02-06 19:01:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-06 19:01:18,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-06 19:01:18,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-06 19:01:18,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-06 19:01:18,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-02-06 19:01:18,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:01:18,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2025-02-06 19:01:18,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-06 19:01:18,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:01:18,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-02-06 19:01:18,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:18,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-02-06 19:01:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-02-06 19:01:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2025-02-06 19:01:18,276 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-02-06 19:01:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-02-06 19:01:18,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-02-06 19:01:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:18,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:01:18,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:01:18,277 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-02-06 19:01:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:18,297 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-02-06 19:01:18,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-02-06 19:01:18,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:01:18,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2025-02-06 19:01:18,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-02-06 19:01:18,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-06 19:01:18,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-02-06 19:01:18,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:18,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-06 19:01:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-02-06 19:01:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-06 19:01:18,299 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-02-06 19:01:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-06 19:01:18,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-06 19:01:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:01:18,301 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-06 19:01:18,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:01:18,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-02-06 19:01:18,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:01:18,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:18,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:18,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1] [2025-02-06 19:01:18,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:01:18,303 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:18,303 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -24479507, now seen corresponding path program 2 times [2025-02-06 19:01:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778679262] [2025-02-06 19:01:18,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:18,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 19:01:18,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:18,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:18,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:18,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:18,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:18,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1090, now seen corresponding path program 1 times [2025-02-06 19:01:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941263446] [2025-02-06 19:01:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:18,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:18,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:18,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:18,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:18,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2049969618, now seen corresponding path program 2 times [2025-02-06 19:01:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291997334] [2025-02-06 19:01:18,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:18,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:01:18,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:01:18,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:18,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291997334] [2025-02-06 19:01:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291997334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24297662] [2025-02-06 19:01:18,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,495 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-02-06 19:01:18,498 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-02-06 19:01:18,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:01:18,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:01:18,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:18,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24297662] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:18,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 19:01:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736290595] [2025-02-06 19:01:18,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:18,658 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:18,658 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:18,658 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:18,658 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:18,658 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:18,658 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,658 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:18,658 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:18,659 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2025-02-06 19:01:18,659 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:18,659 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:18,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:01:18,749 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-02-06 19:01:18,756 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:18,756 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:18,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,758 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:01:18,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:18,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:18,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:01:18,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,778 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:01:18,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:18,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:18,807 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:18,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:01:18,811 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:18,811 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:18,811 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:18,811 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:18,811 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:18,811 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,811 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:18,811 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:18,811 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2025-02-06 19:01:18,811 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:18,811 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:18,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:18,861 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:18,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,863 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:01:18,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:01:18,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:18,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:18,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:18,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:18,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:18,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:18,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:18,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:18,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:18,886 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:18,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,888 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:01:18,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:01:18,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:18,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:18,890 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:18,890 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2025-02-06 19:01:18,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:01:18,896 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:18,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:18,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:18,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:18,961 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:01:18,961 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-02-06 19:01:18,965 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-02-06 19:01:18,965 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-02-06 19:01:18,966 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-02-06 19:01:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:01:18,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-06 19:01:18,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:18,966 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:18,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:18,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:18,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:18,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:18,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:19,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,005 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:19,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:19,027 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-02-06 19:01:19,028 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-02-06 19:01:19,032 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-02-06 19:01:19,032 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-02-06 19:01:19,033 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-02-06 19:01:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:01:19,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-06 19:01:19,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:19,033 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:01:19,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:01:19,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:01:19,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:01:19,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:01:19,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:01:19,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:01:19,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:19,085 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-02-06 19:01:19,085 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-02-06 19:01:19,097 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-02-06 19:01:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:19,098 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-02-06 19:01:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-02-06 19:01:19,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-06 19:01:19,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:19,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-06 19:01:19,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:19,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-06 19:01:19,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:19,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-02-06 19:01:19,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:01:19,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2025-02-06 19:01:19,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:01:19,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-06 19:01:19,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-02-06 19:01:19,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:19,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-06 19:01:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-02-06 19:01:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-06 19:01:19,100 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-02-06 19:01:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-02-06 19:01:19,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-06 19:01:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:01:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:01:19,101 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-02-06 19:01:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:19,136 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-02-06 19:01:19,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2025-02-06 19:01:19,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:19,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 29 transitions. [2025-02-06 19:01:19,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:01:19,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-06 19:01:19,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2025-02-06 19:01:19,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:19,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-06 19:01:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2025-02-06 19:01:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-06 19:01:19,139 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-02-06 19:01:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-06 19:01:19,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 19:01:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:01:19,140 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 19:01:19,140 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:01:19,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2025-02-06 19:01:19,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:19,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:19,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:19,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1] [2025-02-06 19:01:19,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-06 19:01:19,141 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:19,141 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:19,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1054111687, now seen corresponding path program 3 times [2025-02-06 19:01:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822589289] [2025-02-06 19:01:19,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-02-06 19:01:19,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:01:19,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 19:01:19,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:19,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:01:19,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:01:19,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 1 times [2025-02-06 19:01:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011551652] [2025-02-06 19:01:19,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:19,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:19,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:19,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:19,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:19,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:19,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1286821796, now seen corresponding path program 3 times [2025-02-06 19:01:19,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943963252] [2025-02-06 19:01:19,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-02-06 19:01:19,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:01:19,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 19:01:19,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:19,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943963252] [2025-02-06 19:01:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943963252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121072792] [2025-02-06 19:01:19,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:19,386 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:19,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-06 19:01:19,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-02-06 19:01:19,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:01:19,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 19:01:19,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:01:19,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:19,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:19,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:01:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121072792] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:19,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-02-06 19:01:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979744126] [2025-02-06 19:01:19,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:19,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:01:19,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:01:19,743 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-02-06 19:01:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:19,834 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-02-06 19:01:19,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2025-02-06 19:01:19,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:19,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2025-02-06 19:01:19,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:01:19,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-06 19:01:19,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2025-02-06 19:01:19,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:19,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-06 19:01:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2025-02-06 19:01:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-06 19:01:19,839 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-02-06 19:01:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-02-06 19:01:19,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-02-06 19:01:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 19:01:19,842 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-02-06 19:01:19,842 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:01:19,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2025-02-06 19:01:19,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:19,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:19,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:19,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1] [2025-02-06 19:01:19,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-06 19:01:19,844 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:19,844 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:19,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1494151377, now seen corresponding path program 4 times [2025-02-06 19:01:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411699619] [2025-02-06 19:01:19,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,854 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-06 19:01:19,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:01:19,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:19,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 19:01:19,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:01:19,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 2 times [2025-02-06 19:01:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504541138] [2025-02-06 19:01:19,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-02-06 19:01:19,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:19,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:19,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:19,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:19,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1671038196, now seen corresponding path program 4 times [2025-02-06 19:01:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819786195] [2025-02-06 19:01:19,911 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:19,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-06 19:01:19,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:01:19,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:19,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:20,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:20,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819786195] [2025-02-06 19:01:20,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819786195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:20,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050137332] [2025-02-06 19:01:20,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:20,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:20,447 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:20,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-06 19:01:20,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-06 19:01:20,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:01:20,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:20,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:01:20,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:20,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050137332] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:21,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:21,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-02-06 19:01:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019325578] [2025-02-06 19:01:21,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 19:01:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 19:01:21,410 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-02-06 19:01:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:21,566 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2025-02-06 19:01:21,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2025-02-06 19:01:21,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:21,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2025-02-06 19:01:21,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:01:21,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-06 19:01:21,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2025-02-06 19:01:21,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:21,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2025-02-06 19:01:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2025-02-06 19:01:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-06 19:01:21,578 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-02-06 19:01:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-02-06 19:01:21,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-02-06 19:01:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 19:01:21,582 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-02-06 19:01:21,582 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:01:21,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2025-02-06 19:01:21,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:21,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:21,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:21,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1] [2025-02-06 19:01:21,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-06 19:01:21,588 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:21,588 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:21,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 437185025, now seen corresponding path program 5 times [2025-02-06 19:01:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980106620] [2025-02-06 19:01:21,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,599 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 47 equivalence classes. [2025-02-06 19:01:21,644 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 19:01:21,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 19:01:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 19:01:21,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 19:01:21,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 3 times [2025-02-06 19:01:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296458683] [2025-02-06 19:01:21,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 2 equivalence classes. [2025-02-06 19:01:21,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:21,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:01:21,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:21,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:21,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:21,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:21,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1150936612, now seen corresponding path program 5 times [2025-02-06 19:01:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744976522] [2025-02-06 19:01:21,679 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-02-06 19:01:21,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 19:01:21,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-06 19:01:21,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:23,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744976522] [2025-02-06 19:01:23,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744976522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313491580] [2025-02-06 19:01:23,328 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:23,331 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:23,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-06 19:01:23,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-02-06 19:01:23,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 19:01:23,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-06 19:01:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:23,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 19:01:23,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:23,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:01:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313491580] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:24,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2025-02-06 19:01:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145671876] [2025-02-06 19:01:24,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:24,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 19:01:24,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 19:01:24,808 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:24,938 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2025-02-06 19:01:24,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2025-02-06 19:01:24,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:24,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2025-02-06 19:01:24,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:01:24,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-06 19:01:24,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2025-02-06 19:01:24,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:24,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-02-06 19:01:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2025-02-06 19:01:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 19:01:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 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-02-06 19:01:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2025-02-06 19:01:24,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-02-06 19:01:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 19:01:24,954 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-02-06 19:01:24,954 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:01:24,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2025-02-06 19:01:24,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 19:01:24,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:24,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:24,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 49, 1, 1] [2025-02-06 19:01:24,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-06 19:01:24,959 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, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:24,959 INFO L754 eck$LassoCheckResult]: Loop: "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume main_~i~0#1 < main_~j~0#1;" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume main_~i~0#1 < main_~j~0#1;" [2025-02-06 19:01:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2080107289, now seen corresponding path program 6 times [2025-02-06 19:01:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705381457] [2025-02-06 19:01:24,960 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,967 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 50 equivalence classes. [2025-02-06 19:01:24,990 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 19:01:24,990 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2025-02-06 19:01:24,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:24,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 19:01:25,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 19:01:25,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:25,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:25,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 4 times [2025-02-06 19:01:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017275288] [2025-02-06 19:01:25,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:25,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:25,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-02-06 19:01:25,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:25,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:25,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:25,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:01:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:01:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:25,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:25,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 143863306, now seen corresponding path program 6 times [2025-02-06 19:01:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205788162] [2025-02-06 19:01:25,046 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:25,051 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 105 statements into 52 equivalence classes. [2025-02-06 19:01:25,082 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 19:01:25,083 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2025-02-06 19:01:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:25,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:25,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 19:01:25,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 19:01:25,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:25,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:25,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:28,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 19:01:28,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 19:01:28,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 19:01:28,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 19:01:28,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:28,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:28,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:01:28 BoogieIcfgContainer [2025-02-06 19:01:28,193 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:01:28,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:01:28,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:01:28,193 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:01:28,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:01:16" (3/4) ... [2025-02-06 19:01:28,196 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:01:28,253 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:01:28,253 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:01:28,254 INFO L158 Benchmark]: Toolchain (without parser) took 12632.58ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.7MB in the beginning and 350.2MB in the end (delta: -237.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-02-06 19:01:28,254 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:28,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.34ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:28,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.39ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 102.0MB in the end (delta: 884.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:28,255 INFO L158 Benchmark]: Boogie Preprocessor took 18.40ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 909.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:28,256 INFO L158 Benchmark]: IcfgBuilder took 170.58ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 92.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:28,256 INFO L158 Benchmark]: BuchiAutomizer took 12188.13ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 92.1MB in the beginning and 354.5MB in the end (delta: -262.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:28,256 INFO L158 Benchmark]: Witness Printer took 59.63ms. Allocated memory is still 402.7MB. Free memory was 354.5MB in the beginning and 350.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:28,258 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.39ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.34ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.39ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 102.0MB in the end (delta: 884.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.40ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 909.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 170.58ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 92.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 12188.13ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 92.1MB in the beginning and 354.5MB in the end (delta: -262.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.63ms. Allocated memory is still 402.7MB. Free memory was 354.5MB in the beginning and 350.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.0s and 8 iterations. TraceHistogramMax:50. Analysis of lassos took 10.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 51 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 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: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:01:28,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-02-06 19:01:28,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-02-06 19:01:28,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-02-06 19:01:28,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:29,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:29,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)