./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:20:21,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:20:21,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:20:21,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:20:21,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:20:21,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:20:21,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:20:21,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:20:21,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:20:21,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:20:21,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:20:21,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:20:21,088 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:20:21,088 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:20:21,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:20:21,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:20:21,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:20:21,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:20:21,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:20:21,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:20:21,090 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:20:21,090 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2025-02-08 14:20:21,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:20:21,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:20:21,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:20:21,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:20:21,294 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:20:21,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2025-02-08 14:20:22,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68ed387e/fbf1b5c831c44675bb591af201e7d53d/FLAG0897b9e79 [2025-02-08 14:20:22,750 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:20:22,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2025-02-08 14:20:22,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68ed387e/fbf1b5c831c44675bb591af201e7d53d/FLAG0897b9e79 [2025-02-08 14:20:23,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68ed387e/fbf1b5c831c44675bb591af201e7d53d [2025-02-08 14:20:23,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:20:23,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:20:23,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:20:23,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:20:23,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:20:23,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10018cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23, skipping insertion in model container [2025-02-08 14:20:23,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:20:23,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:20:23,151 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:20:23,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:20:23,166 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:20:23,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23 WrapperNode [2025-02-08 14:20:23,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:20:23,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:20:23,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:20:23,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:20:23,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,182 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-08 14:20:23,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:20:23,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:20:23,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:20:23,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:20:23,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,191 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:20:23,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:20:23,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:20:23,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:20:23,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:20:23,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (1/1) ... [2025-02-08 14:20:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:23,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:23,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:23,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:20:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:20:23,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:20:23,279 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:20:23,280 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:20:23,319 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-02-08 14:20:23,319 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:20:23,324 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:20:23,324 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:20:23,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:23 BoogieIcfgContainer [2025-02-08 14:20:23,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:20:23,325 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:20:23,325 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:20:23,329 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:20:23,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:23,329 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:20:23" (1/3) ... [2025-02-08 14:20:23,330 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a33645c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:20:23, skipping insertion in model container [2025-02-08 14:20:23,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:23,330 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:23" (2/3) ... [2025-02-08 14:20:23,330 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a33645c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:20:23, skipping insertion in model container [2025-02-08 14:20:23,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:23,330 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:23" (3/3) ... [2025-02-08 14:20:23,331 INFO L363 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2025-02-08 14:20:23,369 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:20:23,369 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:20:23,369 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:20:23,369 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:20:23,370 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:20:23,370 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:20:23,370 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:20:23,370 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:20:23,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:23,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:20:23,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:23,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:23,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:23,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:23,389 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:20:23,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:23,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:20:23,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:23,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:23,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:23,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:23,396 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:20:23,397 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-02-08 14:20:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936673019] [2025-02-08 14:20:23,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:23,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-02-08 14:20:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703644347] [2025-02-08 14:20:23,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:23,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703644347] [2025-02-08 14:20:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703644347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:20:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107030164] [2025-02-08 14:20:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:23,578 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:20:23,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:20:23,601 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-08 14:20:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:23,649 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2025-02-08 14:20:23,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2025-02-08 14:20:23,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:20:23,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 14 transitions. [2025-02-08 14:20:23,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:20:23,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:20:23,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2025-02-08 14:20:23,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:20:23,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:20:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2025-02-08 14:20:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 14:20:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-02-08 14:20:23,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:20:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:20:23,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-02-08 14:20:23,694 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:20:23,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-02-08 14:20:23,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:20:23,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:23,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:23,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:23,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:23,696 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:20:23,697 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-02-08 14:20:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428083027] [2025-02-08 14:20:23,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:20:23,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:23,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:23,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1137918, now seen corresponding path program 1 times [2025-02-08 14:20:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732925734] [2025-02-08 14:20:23,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:23,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732925734] [2025-02-08 14:20:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732925734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:23,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:23,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:20:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749138027] [2025-02-08 14:20:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:23,744 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:20:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:20:23,745 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 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-08 14:20:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:23,760 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2025-02-08 14:20:23,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2025-02-08 14:20:23,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:20:23,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2025-02-08 14:20:23,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-08 14:20:23,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-08 14:20:23,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-02-08 14:20:23,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:20:23,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:20:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-02-08 14:20:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-08 14:20:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-02-08 14:20:23,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:20:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:20:23,766 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:20:23,766 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:20:23,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-02-08 14:20:23,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:20:23,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:23,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:23,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:23,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:23,770 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:20:23,770 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:20:23,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 3 times [2025-02-08 14:20:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479284743] [2025-02-08 14:20:23,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:20:23,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:23,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1137919, now seen corresponding path program 1 times [2025-02-08 14:20:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309994172] [2025-02-08 14:20:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:23,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:23,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:23,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:23,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 36231717, now seen corresponding path program 1 times [2025-02-08 14:20:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304065837] [2025-02-08 14:20:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:23,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:23,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:23,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:23,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:23,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:23,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:23,857 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:23,857 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:23,858 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:23,858 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:23,858 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:23,858 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:23,858 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:23,858 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:23,858 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2025-02-08 14:20:23,858 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:23,859 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:23,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:23,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:23,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:23,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:23,955 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:23,956 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:23,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:23,964 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-08 14:20:23,965 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-08 14:20:23,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:23,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:23,980 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:23,981 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:23,990 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-08 14:20:23,992 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-08 14:20:23,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:23,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,012 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:24,012 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-08 14:20:24,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:20:24,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:24,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,042 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:24,042 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-08 14:20:24,053 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-08 14:20:24,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:20:24,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:24,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,077 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-08 14:20:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:20:24,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:24,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,104 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:24,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,115 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:24,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:24,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:24,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:24,116 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:24,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:24,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:24,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2025-02-08 14:20:24,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:24,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:24,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,230 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:24,233 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:24,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:20:24,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:24,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:24,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:24,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:24,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:24,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:24,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:24,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:24,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:20:24,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:24,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:24,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:24,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:24,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:24,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:24,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:24,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:24,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:20:24,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:24,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:24,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:24,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:24,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:24,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:24,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:24,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:24,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:24,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:24,318 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:20:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:20:24,324 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:24,324 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:24,324 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:24,324 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:20:24,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,332 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:24,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:24,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:24,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:24,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:24,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:24,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:24,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:24,381 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:20:24,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 50 transitions. Complement of second has 7 states. [2025-02-08 14:20:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-02-08 14:20:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-08 14:20:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:20:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-08 14:20:24,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2025-02-08 14:20:24,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2025-02-08 14:20:24,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 43 transitions. [2025-02-08 14:20:24,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-08 14:20:24,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:20:24,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2025-02-08 14:20:24,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:24,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-02-08 14:20:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2025-02-08 14:20:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-02-08 14:20:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-02-08 14:20:24,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-02-08 14:20:24,423 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-02-08 14:20:24,424 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:20:24,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2025-02-08 14:20:24,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-02-08 14:20:24,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:24,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:24,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:20:24,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:24,424 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" [2025-02-08 14:20:24,424 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" [2025-02-08 14:20:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-02-08 14:20:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653860581] [2025-02-08 14:20:24,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:24,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:24,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:24,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:24,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1106180, now seen corresponding path program 1 times [2025-02-08 14:20:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71365482] [2025-02-08 14:20:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:24,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184195, now seen corresponding path program 1 times [2025-02-08 14:20:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997479876] [2025-02-08 14:20:24,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:20:24,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:20:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:20:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:20:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:24,469 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:24,469 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:24,469 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:24,469 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:24,469 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:24,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:24,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:24,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2025-02-08 14:20:24,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:24,469 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:24,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:24,540 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:24,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:20:24,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:24,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,562 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:24,562 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-08 14:20:24,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,569 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:20:24,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:24,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,591 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:20:24,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:24,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,626 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:24,630 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-08 14:20:24,630 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:24,630 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:24,630 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:24,630 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:24,630 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:24,630 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,631 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:24,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:24,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2025-02-08 14:20:24,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:24,631 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:24,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,659 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-08 14:20:24,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,719 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:24,719 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:20:24,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:24,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:24,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:24,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:24,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:24,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:24,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:24,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:24,744 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-08 14:20:24,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:20:24,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:24,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:24,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:24,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:24,759 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:20:24,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:24,761 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-02-08 14:20:24,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:24,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:24,765 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:20:24,765 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,767 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:20:24,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:24,769 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:24,769 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:24,769 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:20:24,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:24,777 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:24,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:24,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:24,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:24,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:24,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:24,820 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:20:24,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 7 states. [2025-02-08 14:20:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:20:24,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-08 14:20:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-08 14:20:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-08 14:20:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:24,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-02-08 14:20:24,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:20:24,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 48 transitions. [2025-02-08 14:20:24,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:20:24,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:20:24,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 48 transitions. [2025-02-08 14:20:24,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:24,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-02-08 14:20:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 48 transitions. [2025-02-08 14:20:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 14:20:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2025-02-08 14:20:24,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-02-08 14:20:24,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-02-08 14:20:24,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:20:24,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2025-02-08 14:20:24,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:20:24,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:24,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:24,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:20:24,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:24,861 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:24,861 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:24,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash 36230786, now seen corresponding path program 1 times [2025-02-08 14:20:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408346511] [2025-02-08 14:20:24,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:24,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:24,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:24,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1136988, now seen corresponding path program 1 times [2025-02-08 14:20:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145469953] [2025-02-08 14:20:24,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:24,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:24,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:24,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:24,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2096695133, now seen corresponding path program 2 times [2025-02-08 14:20:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903731277] [2025-02-08 14:20:24,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:24,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:20:24,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:20:24,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:24,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:24,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903731277] [2025-02-08 14:20:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903731277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:20:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249955472] [2025-02-08 14:20:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:24,914 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:24,914 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:24,914 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:24,914 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:24,915 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:24,915 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:24,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:24,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2025-02-08 14:20:24,915 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:24,915 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:24,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:24,955 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:24,955 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,961 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:20:24,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:24,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:24,984 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-08 14:20:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:24,986 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:24,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:20:24,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:24,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,003 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:25,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:20:25,015 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:25,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:25,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:25,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:25,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:25,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:25,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:25,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2025-02-08 14:20:25,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:25,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:25,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:25,066 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,080 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-08 14:20:25,081 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-08 14:20:25,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:25,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:25,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:25,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:25,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:25,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:25,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:25,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:25,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:25,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:25,097 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,099 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-08 14:20:25,101 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-08 14:20:25,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:25,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:25,102 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:25,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2025-02-08 14:20:25,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,108 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:25,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:25,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:25,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:25,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:25,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:25,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:25,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:25,148 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:20:25,148 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Result 48 states and 72 transitions. Complement of second has 7 states. [2025-02-08 14:20:25,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-02-08 14:20:25,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:20:25,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-08 14:20:25,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-08 14:20:25,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 72 transitions. [2025-02-08 14:20:25,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-02-08 14:20:25,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 71 transitions. [2025-02-08 14:20:25,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-08 14:20:25,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-08 14:20:25,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 71 transitions. [2025-02-08 14:20:25,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:25,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 71 transitions. [2025-02-08 14:20:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 71 transitions. [2025-02-08 14:20:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-02-08 14:20:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-02-08 14:20:25,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-02-08 14:20:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:25,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:20:25,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:20:25,174 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:25,188 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2025-02-08 14:20:25,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2025-02-08 14:20:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2025-02-08 14:20:25,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 66 transitions. [2025-02-08 14:20:25,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-08 14:20:25,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-08 14:20:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 66 transitions. [2025-02-08 14:20:25,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:25,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-02-08 14:20:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 66 transitions. [2025-02-08 14:20:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2025-02-08 14:20:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2025-02-08 14:20:25,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2025-02-08 14:20:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:20:25,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2025-02-08 14:20:25,192 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:20:25,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 50 transitions. [2025-02-08 14:20:25,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-08 14:20:25,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:25,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:25,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:20:25,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:25,193 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:25,193 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 36230786, now seen corresponding path program 3 times [2025-02-08 14:20:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981261338] [2025-02-08 14:20:25,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:25,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:25,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:25,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:20:25,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:25,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:25,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1137949, now seen corresponding path program 1 times [2025-02-08 14:20:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:25,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180093302] [2025-02-08 14:20:25,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:25,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:25,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:25,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:25,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:25,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2096696094, now seen corresponding path program 1 times [2025-02-08 14:20:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667957171] [2025-02-08 14:20:25,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:25,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:25,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:20:25,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:20:25,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:20:25,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:20:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:25,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:25,231 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:25,232 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:25,232 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:25,232 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:25,232 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:25,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,232 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:25,232 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:25,232 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2025-02-08 14:20:25,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:25,232 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:25,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,315 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:25,315 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:25,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,317 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-08 14:20:25,322 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-08 14:20:25,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:25,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,334 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:25,334 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:25,340 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-08 14:20:25,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,341 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-08 14:20:25,343 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-08 14:20:25,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:25,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,362 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:25,362 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:25,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,369 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:25,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:20:25,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:25,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,389 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:25,389 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:25,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,397 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-08 14:20:25,398 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-08 14:20:25,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:25,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,419 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-08 14:20:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,422 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-08 14:20:25,422 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-08 14:20:25,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:25,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,449 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:25,449 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=11} Honda state: {ULTIMATE.start_main_~i~0#1=11} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [7, 23, 1] Nus: [1, 0] [2025-02-08 14:20:25,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,480 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:25,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:25,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:25,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:25,481 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:25,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:25,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:25,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Lasso [2025-02-08 14:20:25,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:25,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:25,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,568 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:25,568 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:25,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,570 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-08 14:20:25,572 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-08 14:20:25,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:25,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,588 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-08 14:20:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,591 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-08 14:20:25,592 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-08 14:20:25,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:25,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:25,614 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:25,618 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-08 14:20:25,619 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:25,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:25,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:25,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:25,619 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:25,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,619 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:25,619 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:25,619 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Lasso [2025-02-08 14:20:25,619 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:25,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:25,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:25,717 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:25,717 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:25,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,719 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:25,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:20:25,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:25,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:25,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:25,731 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:20:25,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:25,735 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:20:25,735 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:20:25,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:25,762 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-08 14:20:25,762 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-08 14:20:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:25,766 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:25,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:20:25,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:25,780 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-02-08 14:20:25,781 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:25,781 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2025-02-08 14:20:25,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:20:25,793 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-08 14:20:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:20:25,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:25,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:20:25,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:25,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:25,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:25,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:25,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:25,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:25,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:20:25,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:25,916 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-08 14:20:25,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) Result 43 states and 63 transitions. Complement of second has 8 states. [2025-02-08 14:20:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-02-08 14:20:25,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:20:25,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-08 14:20:25,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-08 14:20:25,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:25,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 63 transitions. [2025-02-08 14:20:25,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-08 14:20:25,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 62 transitions. [2025-02-08 14:20:25,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-08 14:20:25,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-08 14:20:25,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2025-02-08 14:20:25,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:25,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-02-08 14:20:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2025-02-08 14:20:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-02-08 14:20:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-02-08 14:20:25,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-02-08 14:20:25,976 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-02-08 14:20:25,976 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:20:25,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2025-02-08 14:20:25,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-02-08 14:20:25,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:25,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:25,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:20:25,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:25,977 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:20:25,977 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-02-08 14:20:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1314561346, now seen corresponding path program 1 times [2025-02-08 14:20:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:25,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854982562] [2025-02-08 14:20:25,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:25,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:25,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:20:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:20:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854982562] [2025-02-08 14:20:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854982562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007956020] [2025-02-08 14:20:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:25,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:25,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,000 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-08 14:20:26,001 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-08 14:20:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:20:26,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:20:26,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:26,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007956020] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:26,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:20:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268327688] [2025-02-08 14:20:26,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,052 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 990019, now seen corresponding path program 2 times [2025-02-08 14:20:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276609176] [2025-02-08 14:20:26,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:26,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:26,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:20:26,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:26,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:26,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:26,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:26,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:26,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:26,074 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:26,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:26,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:26,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:26,074 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:26,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:26,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:26,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2025-02-08 14:20:26,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:26,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:26,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,125 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:26,125 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:26,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,126 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:20:26,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:26,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:26,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,147 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:20:26,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:26,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:26,160 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:26,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:26,166 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:26,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:26,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:26,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:26,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:26,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:26,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:26,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2025-02-08 14:20:26,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:26,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:26,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:26,215 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:26,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,218 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:20:26,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:26,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:26,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:26,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:26,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:26,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:26,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:26,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:26,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:26,233 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:20:26,233 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:26,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,235 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:20:26,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:26,237 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:26,238 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:26,238 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:20:26,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-08 14:20:26,244 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:26,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:20:26,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:20:26,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:26,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:26,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:26,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:26,280 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:20:26,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 25 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-08 14:20:26,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 25. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 155 transitions. Complement of second has 7 states. [2025-02-08 14:20:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-08 14:20:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:20:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:20:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-08 14:20:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-08 14:20:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:26,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 155 transitions. [2025-02-08 14:20:26,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-08 14:20:26,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 86 states and 128 transitions. [2025-02-08 14:20:26,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-02-08 14:20:26,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-02-08 14:20:26,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2025-02-08 14:20:26,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:26,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 128 transitions. [2025-02-08 14:20:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2025-02-08 14:20:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-02-08 14:20:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 80 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2025-02-08 14:20:26,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 122 transitions. [2025-02-08 14:20:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:26,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:20:26,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:20:26,312 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:26,349 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2025-02-08 14:20:26,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 214 transitions. [2025-02-08 14:20:26,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2025-02-08 14:20:26,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 214 transitions. [2025-02-08 14:20:26,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-02-08 14:20:26,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-02-08 14:20:26,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 214 transitions. [2025-02-08 14:20:26,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:26,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 214 transitions. [2025-02-08 14:20:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 214 transitions. [2025-02-08 14:20:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2025-02-08 14:20:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 136 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2025-02-08 14:20:26,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-02-08 14:20:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:20:26,364 INFO L432 stractBuchiCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-02-08 14:20:26,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:20:26,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 190 transitions. [2025-02-08 14:20:26,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2025-02-08 14:20:26,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:26,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:26,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:20:26,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:20:26,366 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:20:26,366 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:20:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2096696095, now seen corresponding path program 1 times [2025-02-08 14:20:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254449031] [2025-02-08 14:20:26,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:20:26,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:20:26,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:20:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254449031] [2025-02-08 14:20:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254449031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:20:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845918986] [2025-02-08 14:20:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,394 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:26,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1136989, now seen corresponding path program 1 times [2025-02-08 14:20:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628954739] [2025-02-08 14:20:26,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:26,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:26,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628954739] [2025-02-08 14:20:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628954739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:26,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:20:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882876799] [2025-02-08 14:20:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,415 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:26,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:20:26,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:20:26,415 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. cyclomatic complexity: 64 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-08 14:20:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:26,420 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2025-02-08 14:20:26,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 119 transitions. [2025-02-08 14:20:26,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-02-08 14:20:26,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 95 transitions. [2025-02-08 14:20:26,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-02-08 14:20:26,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-02-08 14:20:26,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 95 transitions. [2025-02-08 14:20:26,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:26,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-02-08 14:20:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 95 transitions. [2025-02-08 14:20:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-02-08 14:20:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 77 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-02-08 14:20:26,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-08 14:20:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:20:26,427 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-08 14:20:26,427 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:20:26,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 92 transitions. [2025-02-08 14:20:26,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-02-08 14:20:26,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:26,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:26,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 2, 1, 1, 1] [2025-02-08 14:20:26,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2025-02-08 14:20:26,428 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,428 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1251848370, now seen corresponding path program 1 times [2025-02-08 14:20:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455590386] [2025-02-08 14:20:26,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:20:26,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:20:26,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:20:26,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455590386] [2025-02-08 14:20:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455590386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:20:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159301261] [2025-02-08 14:20:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,482 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash 486762350, now seen corresponding path program 1 times [2025-02-08 14:20:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260793282] [2025-02-08 14:20:26,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:26,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:20:26,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:20:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:26,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260793282] [2025-02-08 14:20:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260793282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:20:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73969619] [2025-02-08 14:20:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,530 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:26,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:20:26,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:20:26,530 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. cyclomatic complexity: 21 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:26,546 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2025-02-08 14:20:26,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 109 transitions. [2025-02-08 14:20:26,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-02-08 14:20:26,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 109 transitions. [2025-02-08 14:20:26,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-02-08 14:20:26,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-02-08 14:20:26,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 109 transitions. [2025-02-08 14:20:26,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:26,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 109 transitions. [2025-02-08 14:20:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 109 transitions. [2025-02-08 14:20:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-02-08 14:20:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 83 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-08 14:20:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-02-08 14:20:26,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-02-08 14:20:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:20:26,551 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-02-08 14:20:26,551 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:20:26,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 97 transitions. [2025-02-08 14:20:26,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-08 14:20:26,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:26,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:26,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2025-02-08 14:20:26,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-02-08 14:20:26,553 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,553 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1847720207, now seen corresponding path program 2 times [2025-02-08 14:20:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793263625] [2025-02-08 14:20:26,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:20:26,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:20:26,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:26,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:20:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793263625] [2025-02-08 14:20:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793263625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312953731] [2025-02-08 14:20:26,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,606 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-02-08 14:20:26,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:20:26,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:20:26,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:20:26,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:20:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312953731] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:26,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-08 14:20:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557334960] [2025-02-08 14:20:26,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,728 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:26,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1793723957, now seen corresponding path program 2 times [2025-02-08 14:20:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773520052] [2025-02-08 14:20:26,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:20:26,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:20:26,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773520052] [2025-02-08 14:20:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773520052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715532091] [2025-02-08 14:20:26,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,762 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-02-08 14:20:26,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:20:26,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:20:26,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:26,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:26,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715532091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:26,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 14:20:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058105250] [2025-02-08 14:20:26,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:26,819 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:26,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:20:26,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:20:26,819 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:26,854 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2025-02-08 14:20:26,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 185 transitions. [2025-02-08 14:20:26,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-02-08 14:20:26,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 185 transitions. [2025-02-08 14:20:26,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-02-08 14:20:26,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-02-08 14:20:26,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 185 transitions. [2025-02-08 14:20:26,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:26,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 185 transitions. [2025-02-08 14:20:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 185 transitions. [2025-02-08 14:20:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2025-02-08 14:20:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-02-08 14:20:26,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-02-08 14:20:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:20:26,862 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-02-08 14:20:26,862 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:20:26,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2025-02-08 14:20:26,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-02-08 14:20:26,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:26,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:26,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1] [2025-02-08 14:20:26,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2025-02-08 14:20:26,864 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,864 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:26,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -745211517, now seen corresponding path program 3 times [2025-02-08 14:20:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139326258] [2025-02-08 14:20:26,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:26,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-02-08 14:20:26,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-02-08 14:20:26,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 14:20:26,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:20:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:20:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139326258] [2025-02-08 14:20:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139326258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50482213] [2025-02-08 14:20:26,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:26,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:26,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:26,965 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:26,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-02-08 14:20:26,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-02-08 14:20:26,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-02-08 14:20:26,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 14:20:26,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:26,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:20:26,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:20:27,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:20:27,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50482213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:27,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-02-08 14:20:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553267813] [2025-02-08 14:20:27,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:27,100 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2141717953, now seen corresponding path program 3 times [2025-02-08 14:20:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128776503] [2025-02-08 14:20:27,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:27,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-08 14:20:27,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-08 14:20:27,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 14:20:27,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128776503] [2025-02-08 14:20:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128776503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260504501] [2025-02-08 14:20:27,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,208 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-02-08 14:20:27,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-02-08 14:20:27,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-02-08 14:20:27,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 14:20:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:27,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:20:27,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:27,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:20:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260504501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:27,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-02-08 14:20:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99272845] [2025-02-08 14:20:27,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:27,332 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:20:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:27,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:20:27,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:20:27,333 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 28 Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:27,373 INFO L93 Difference]: Finished difference Result 205 states and 242 transitions. [2025-02-08 14:20:27,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 242 transitions. [2025-02-08 14:20:27,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-02-08 14:20:27,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 205 states and 242 transitions. [2025-02-08 14:20:27,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-08 14:20:27,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-08 14:20:27,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 242 transitions. [2025-02-08 14:20:27,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:27,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 242 transitions. [2025-02-08 14:20:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 242 transitions. [2025-02-08 14:20:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2025-02-08 14:20:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2025-02-08 14:20:27,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 195 transitions. [2025-02-08 14:20:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:20:27,379 INFO L432 stractBuchiCegarLoop]: Abstraction has 168 states and 195 transitions. [2025-02-08 14:20:27,379 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:20:27,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 195 transitions. [2025-02-08 14:20:27,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2025-02-08 14:20:27,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:27,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:27,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2025-02-08 14:20:27,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2025-02-08 14:20:27,381 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:27,381 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 138214810, now seen corresponding path program 4 times [2025-02-08 14:20:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076079080] [2025-02-08 14:20:27,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:27,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-08 14:20:27,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 14:20:27,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:20:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-08 14:20:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076079080] [2025-02-08 14:20:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076079080] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765509349] [2025-02-08 14:20:27,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,432 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-02-08 14:20:27,450 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-08 14:20:27,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 14:20:27,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:20:27,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:27,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:20:27,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-08 14:20:27,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-08 14:20:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765509349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:27,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-08 14:20:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886066025] [2025-02-08 14:20:27,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:27,530 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:27,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash -793197482, now seen corresponding path program 4 times [2025-02-08 14:20:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481270912] [2025-02-08 14:20:27,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:27,533 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-02-08 14:20:27,536 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:20:27,536 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:20:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:27,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:27,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:20:27,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:20:27,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:27,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:27,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:27,714 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:27,714 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:27,715 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:27,715 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:27,715 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:27,715 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,715 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:27,715 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:27,715 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2025-02-08 14:20:27,715 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:27,715 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:27,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,753 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:27,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:27,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,755 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:20:27,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:27,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:27,774 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:27,775 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:27,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:27,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,782 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:20:27,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:27,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:27,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,809 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:20:27,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:27,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:27,823 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:27,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:27,829 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:27,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:27,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:27,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:27,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:27,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:27,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:27,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2025-02-08 14:20:27,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:27,830 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:27,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:27,882 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:27,882 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:27,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,885 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:20:27,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:27,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:27,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:27,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:27,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:27,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:27,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:27,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:27,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,912 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:20:27,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:27,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:27,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:27,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:27,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:27,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:27,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:27,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:27,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:27,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:27,934 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:20:27,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:27,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:27,940 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:27,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:20:27,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:27,945 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:27,945 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:27,945 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:20:27,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:27,952 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:27,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:27,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 14:20:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 14:20:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:27,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:27,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:28,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:20:28,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:20:28,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:28,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:28,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:20:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-08 14:20:28,122 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-02-08 14:20:28,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 168 states and 195 transitions. cyclomatic complexity: 34 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:28,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 168 states and 195 transitions. cyclomatic complexity: 34. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 590 states and 698 transitions. Complement of second has 23 states. [2025-02-08 14:20:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2025-02-08 14:20:28,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 52 letters. [2025-02-08 14:20:28,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:28,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 107 letters. Loop has 52 letters. [2025-02-08 14:20:28,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:28,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 104 letters. [2025-02-08 14:20:28,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:28,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 698 transitions. [2025-02-08 14:20:28,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2025-02-08 14:20:28,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 489 states and 568 transitions. [2025-02-08 14:20:28,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-02-08 14:20:28,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-02-08 14:20:28,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 568 transitions. [2025-02-08 14:20:28,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:28,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 489 states and 568 transitions. [2025-02-08 14:20:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 568 transitions. [2025-02-08 14:20:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 445. [2025-02-08 14:20:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 445 states have (on average 1.1775280898876404) internal successors, (524), 444 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 524 transitions. [2025-02-08 14:20:28,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 445 states and 524 transitions. [2025-02-08 14:20:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:28,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:20:28,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:20:28,309 INFO L87 Difference]: Start difference. First operand 445 states and 524 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:28,356 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2025-02-08 14:20:28,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 310 transitions. [2025-02-08 14:20:28,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2025-02-08 14:20:28,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 235 states and 262 transitions. [2025-02-08 14:20:28,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-02-08 14:20:28,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-02-08 14:20:28,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 262 transitions. [2025-02-08 14:20:28,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:28,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 262 transitions. [2025-02-08 14:20:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 262 transitions. [2025-02-08 14:20:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 228. [2025-02-08 14:20:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 228 states have (on average 1.118421052631579) internal successors, (255), 227 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 255 transitions. [2025-02-08 14:20:28,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 228 states and 255 transitions. [2025-02-08 14:20:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:20:28,365 INFO L432 stractBuchiCegarLoop]: Abstraction has 228 states and 255 transitions. [2025-02-08 14:20:28,366 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:20:28,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 255 transitions. [2025-02-08 14:20:28,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2025-02-08 14:20:28,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:28,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:28,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2025-02-08 14:20:28,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2025-02-08 14:20:28,368 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:28,368 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-02-08 14:20:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1536155046, now seen corresponding path program 5 times [2025-02-08 14:20:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481623924] [2025-02-08 14:20:28,369 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:20:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:28,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 19 equivalence classes. [2025-02-08 14:20:28,382 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:20:28,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-02-08 14:20:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 14:20:28,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:20:28,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:28,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1497305502, now seen corresponding path program 5 times [2025-02-08 14:20:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954813695] [2025-02-08 14:20:28,394 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:20:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:28,397 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 18 equivalence classes. [2025-02-08 14:20:28,405 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 14:20:28,407 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-08 14:20:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 14:20:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 14:20:28,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:28,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:28,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1670926585, now seen corresponding path program 6 times [2025-02-08 14:20:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595059658] [2025-02-08 14:20:28,419 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:20:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:28,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 37 equivalence classes. [2025-02-08 14:20:28,438 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 14:20:28,439 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2025-02-08 14:20:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:28,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 14:20:28,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-08 14:20:28,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 14:20:28,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:28,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:29,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 14:20:29,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:20:29,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:29,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:29,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 14:20:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:20:29,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:29,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:29,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:20:29 BoogieIcfgContainer [2025-02-08 14:20:29,142 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:20:29,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:20:29,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:20:29,142 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:20:29,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:23" (3/4) ... [2025-02-08 14:20:29,144 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:20:29,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:20:29,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:20:29,229 INFO L158 Benchmark]: Toolchain (without parser) took 6167.85ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.8MB in the beginning and 135.3MB in the end (delta: -1.5MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 104.79ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 123.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.80ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.6MB in the end (delta: 914.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: Boogie Preprocessor took 10.80ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.7MB in the end (delta: 917.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: IcfgBuilder took 130.20ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 112.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:20:29,230 INFO L158 Benchmark]: BuchiAutomizer took 5816.58ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 141.9MB in the end (delta: -29.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2025-02-08 14:20:29,234 INFO L158 Benchmark]: Witness Printer took 87.00ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 135.3MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:29,235 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.19ms. Allocated memory is still 234.9MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 104.79ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 123.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.80ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.6MB in the end (delta: 914.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.80ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.7MB in the end (delta: 917.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 130.20ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 112.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5816.58ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 141.9MB in the end (delta: -29.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 87.00ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 135.3MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (9 trivial, 6 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 3) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 21) and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 12 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 228 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 4.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 171 StatesRemovedByMinimization, 12 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 136/312 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 97 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI4 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax180 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq190 hnf92 smp94 dnf125 smp96 tf109 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:20:29,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:29,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:29,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:29,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-02-08 14:20:30,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:30,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:30,455 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)