./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:11:36,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:11:36,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:11:36,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:11:36,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:11:36,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:11:36,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:11:36,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:11:36,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:11:36,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:11:36,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:11:36,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:11:36,631 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:11:36,632 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:11:36,632 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:11:36,634 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:11:36,635 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:11:36,635 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:11:36,635 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:11:36,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:11:36,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:11:36,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:11:36,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:11:36,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:11:36,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:11:36,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:11:36,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:11:36,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:11:36,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:11:36,643 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:11:36,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:11:36,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:11:36,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:11:36,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:11:36,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:11:36,644 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:11:36,645 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2024-10-15 00:11:36,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:11:36,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:11:36,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:11:36,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:11:36,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:11:36,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-10-15 00:11:38,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:11:38,731 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:11:38,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-10-15 00:11:38,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e6952d0/a4f80d84acdd47e8bc28fff418c2a22b/FLAG149fe47e2 [2024-10-15 00:11:38,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e6952d0/a4f80d84acdd47e8bc28fff418c2a22b [2024-10-15 00:11:38,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:11:38,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:11:38,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:11:38,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:11:38,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:11:38,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:38,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9586ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38, skipping insertion in model container [2024-10-15 00:11:38,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:38,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:11:38,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:11:38,936 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:11:38,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:11:38,962 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:11:38,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38 WrapperNode [2024-10-15 00:11:38,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:11:38,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:11:38,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:11:38,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:11:38,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:38,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:38,989 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-10-15 00:11:38,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:11:38,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:11:38,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:11:38,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:11:39,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,008 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-15 00:11:39,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:11:39,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:11:39,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:11:39,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:11:39,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (1/1) ... [2024-10-15 00:11:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:39,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:39,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:11:39,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:11:39,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:11:39,176 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:11:39,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:11:39,248 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 00:11:39,249 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:11:39,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:11:39,259 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:11:39,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:39 BoogieIcfgContainer [2024-10-15 00:11:39,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:11:39,261 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:11:39,261 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:11:39,265 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:11:39,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:39,265 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:11:38" (1/3) ... [2024-10-15 00:11:39,266 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cc97ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:11:39, skipping insertion in model container [2024-10-15 00:11:39,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:39,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:38" (2/3) ... [2024-10-15 00:11:39,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cc97ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:11:39, skipping insertion in model container [2024-10-15 00:11:39,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:39,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:39" (3/3) ... [2024-10-15 00:11:39,268 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2024-10-15 00:11:39,327 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:11:39,328 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:11:39,328 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:11:39,328 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:11:39,329 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:11:39,329 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:11:39,329 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:11:39,330 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:11:39,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-10-15 00:11:39,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:11:39,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:39,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:39,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:39,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:39,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:11:39,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-10-15 00:11:39,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:11:39,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:39,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:39,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:39,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:39,367 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2024-10-15 00:11:39,368 INFO L747 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2024-10-15 00:11:39,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:11:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548174737] [2024-10-15 00:11:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:39,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2024-10-15 00:11:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169480284] [2024-10-15 00:11:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169480284] [2024-10-15 00:11:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169480284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:39,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084678938] [2024-10-15 00:11:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:39,620 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:39,648 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:39,674 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2024-10-15 00:11:39,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2024-10-15 00:11:39,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:39,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions. [2024-10-15 00:11:39,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:11:39,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:11:39,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2024-10-15 00:11:39,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:11:39,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-15 00:11:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2024-10-15 00:11:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:11:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2024-10-15 00:11:39,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-15 00:11:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:39,712 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-15 00:11:39,712 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:11:39,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2024-10-15 00:11:39,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:39,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:39,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:39,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:39,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:39,714 INFO L745 eck$LassoCheckResult]: Stem: 43#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 44#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 48#L26-1 [2024-10-15 00:11:39,714 INFO L747 eck$LassoCheckResult]: Loop: 48#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 54#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 51#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 49#L17-1 assume !(1 == main_~up~0#1); 50#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 46#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 48#L26-1 [2024-10-15 00:11:39,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:11:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416683421] [2024-10-15 00:11:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2024-10-15 00:11:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372148137] [2024-10-15 00:11:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372148137] [2024-10-15 00:11:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372148137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521272894] [2024-10-15 00:11:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:39,787 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:11:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:11:39,788 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:39,838 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2024-10-15 00:11:39,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2024-10-15 00:11:39,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-15 00:11:39,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2024-10-15 00:11:39,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-15 00:11:39,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-15 00:11:39,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2024-10-15 00:11:39,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:11:39,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-15 00:11:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2024-10-15 00:11:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-15 00:11:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2024-10-15 00:11:39,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-15 00:11:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:11:39,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2024-10-15 00:11:39,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:11:39,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2024-10-15 00:11:39,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-15 00:11:39,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:39,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:39,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:39,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:39,864 INFO L745 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 110#L26-1 [2024-10-15 00:11:39,865 INFO L747 eck$LassoCheckResult]: Loop: 110#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 125#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 119#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 115#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 116#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 121#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 110#L26-1 [2024-10-15 00:11:39,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:11:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132006167] [2024-10-15 00:11:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2024-10-15 00:11:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374711467] [2024-10-15 00:11:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374711467] [2024-10-15 00:11:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374711467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384138875] [2024-10-15 00:11:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:39,933 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:39,934 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:39,960 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2024-10-15 00:11:39,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2024-10-15 00:11:39,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-15 00:11:39,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2024-10-15 00:11:39,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-15 00:11:39,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-15 00:11:39,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2024-10-15 00:11:39,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:11:39,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2024-10-15 00:11:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2024-10-15 00:11:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-10-15 00:11:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-10-15 00:11:39,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-15 00:11:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:39,976 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-15 00:11:39,976 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:11:39,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-10-15 00:11:39,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-15 00:11:39,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:39,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:39,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:39,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:39,979 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 188#L26-1 [2024-10-15 00:11:39,979 INFO L747 eck$LassoCheckResult]: Loop: 188#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 199#L14 assume !(0 == main_~i~0#1); 205#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 203#L17-1 assume !(1 == main_~up~0#1); 202#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 200#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 188#L26-1 [2024-10-15 00:11:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:11:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987674370] [2024-10-15 00:11:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:39,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:39,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2024-10-15 00:11:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672301227] [2024-10-15 00:11:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2024-10-15 00:11:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:40,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040004262] [2024-10-15 00:11:40,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:40,174 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:40,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:40,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:40,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:40,175 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:40,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,176 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:40,176 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:40,176 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-10-15 00:11:40,176 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:40,176 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:40,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:40,334 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:40,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:11:40,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:40,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:40,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:40,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:40,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:40,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:11:40,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:40,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:40,410 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:40,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:11:40,415 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:40,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:40,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:40,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:40,416 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:40,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:40,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:40,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-10-15 00:11:40,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:40,416 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:40,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:40,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:40,536 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:40,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:40,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:11:40,548 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 [2024-10-15 00:11:40,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:40,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:40,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:40,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:40,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:40,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:40,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:40,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:40,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:11:40,581 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-15 00:11:40,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:40,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:40,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:11:40,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:40,602 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:40,602 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:40,603 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 [] [2024-10-15 00:11:40,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:11:40,621 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:40,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:40,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:40,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:40,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:40,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:40,764 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:11:40,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:40,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2024-10-15 00:11:40,836 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 [2024-10-15 00:11:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-15 00:11:40,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-15 00:11:40,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:40,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2024-10-15 00:11:40,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:40,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2024-10-15 00:11:40,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:40,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2024-10-15 00:11:40,845 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2024-10-15 00:11:40,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2024-10-15 00:11:40,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-15 00:11:40,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-10-15 00:11:40,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2024-10-15 00:11:40,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:40,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2024-10-15 00:11:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2024-10-15 00:11:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2024-10-15 00:11:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2024-10-15 00:11:40,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-10-15 00:11:40,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-10-15 00:11:40,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:11:40,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2024-10-15 00:11:40,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2024-10-15 00:11:40,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:40,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:40,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:11:40,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:40,863 INFO L745 eck$LassoCheckResult]: Stem: 365#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2024-10-15 00:11:40,863 INFO L747 eck$LassoCheckResult]: Loop: 384#L14 assume !(0 == main_~i~0#1); 435#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 431#L17-1 assume !(1 == main_~up~0#1); 428#L20-1 assume !(0 == main_~up~0#1); 424#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 423#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2024-10-15 00:11:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-15 00:11:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:40,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744852606] [2024-10-15 00:11:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2024-10-15 00:11:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232249002] [2024-10-15 00:11:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:40,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2024-10-15 00:11:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591414715] [2024-10-15 00:11:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591414715] [2024-10-15 00:11:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591414715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404673380] [2024-10-15 00:11:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:40,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:40,973 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:40,992 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2024-10-15 00:11:40,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2024-10-15 00:11:40,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-10-15 00:11:40,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2024-10-15 00:11:40,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-10-15 00:11:40,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-15 00:11:40,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2024-10-15 00:11:40,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:40,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-10-15 00:11:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2024-10-15 00:11:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-10-15 00:11:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-10-15 00:11:41,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-10-15 00:11:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:41,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-10-15 00:11:41,017 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:11:41,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2024-10-15 00:11:41,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2024-10-15 00:11:41,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:41,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:41,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:11:41,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:41,020 INFO L745 eck$LassoCheckResult]: Stem: 539#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 540#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 568#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 582#L14-2 [2024-10-15 00:11:41,020 INFO L747 eck$LassoCheckResult]: Loop: 582#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 593#L17-1 assume !(1 == main_~up~0#1); 591#L20-1 assume !(0 == main_~up~0#1); 588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 535#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 536#L14 assume !(0 == main_~i~0#1); 582#L14-2 [2024-10-15 00:11:41,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-15 00:11:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873405868] [2024-10-15 00:11:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:41,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2024-10-15 00:11:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55426596] [2024-10-15 00:11:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2024-10-15 00:11:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51389431] [2024-10-15 00:11:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51389431] [2024-10-15 00:11:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51389431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427198955] [2024-10-15 00:11:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:41,108 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:41,121 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-10-15 00:11:41,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2024-10-15 00:11:41,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:11:41,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2024-10-15 00:11:41,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:11:41,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:11:41,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2024-10-15 00:11:41,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:41,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-10-15 00:11:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2024-10-15 00:11:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-10-15 00:11:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-10-15 00:11:41,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-15 00:11:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:41,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-15 00:11:41,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:11:41,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2024-10-15 00:11:41,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:11:41,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:41,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:41,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:11:41,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:41,138 INFO L745 eck$LassoCheckResult]: Stem: 661#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 675#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 658#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2024-10-15 00:11:41,138 INFO L747 eck$LassoCheckResult]: Loop: 682#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 663#L20-1 assume !(0 == main_~up~0#1); 664#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 689#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 684#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2024-10-15 00:11:41,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-10-15 00:11:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294235294] [2024-10-15 00:11:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:41,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2024-10-15 00:11:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176529644] [2024-10-15 00:11:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2024-10-15 00:11:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:41,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469491014] [2024-10-15 00:11:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:41,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:41,313 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:41,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:41,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:41,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:41,314 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:41,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:41,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:41,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-10-15 00:11:41,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:41,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:41,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:11:41,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,478 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:41,478 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:11:41,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:41,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:41,510 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:41,510 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: [] [2024-10-15 00:11:41,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:11:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:11:41,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:41,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:41,558 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:41,558 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:41,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:11:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,576 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:11:41,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:41,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:41,594 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:41,594 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: [] [2024-10-15 00:11:41,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:11:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:11:41,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:41,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:41,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:11:41,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:11:41,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:41,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:41,820 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:41,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:41,827 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:41,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:41,827 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:41,827 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:41,827 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:41,827 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,827 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:41,827 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:41,827 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-10-15 00:11:41,827 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:41,827 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:41,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:41,958 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:41,958 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:41,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:41,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:11:41,964 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 [2024-10-15 00:11:41,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:41,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:41,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:41,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:41,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:41,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:41,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:41,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:11:42,003 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 [2024-10-15 00:11:42,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:42,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:42,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:42,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:42,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:42,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:42,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:42,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:11:42,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:11:42,046 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 [2024-10-15 00:11:42,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:42,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:42,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:42,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:42,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:42,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:42,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:42,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:42,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:11:42,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,082 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:11:42,084 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 [2024-10-15 00:11:42,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:42,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:42,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:42,098 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:42,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:42,100 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:42,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:42,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:42,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:11:42,107 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,111 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:11:42,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:42,114 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:42,115 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:42,115 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2024-10-15 00:11:42,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:11:42,132 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:42,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:42,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:42,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:11:42,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:42,223 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:11:42,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:42,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 124 transitions. Complement of second has 7 states. [2024-10-15 00:11:42,280 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 [2024-10-15 00:11:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-10-15 00:11:42,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2024-10-15 00:11:42,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:42,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-15 00:11:42,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:42,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2024-10-15 00:11:42,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:42,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2024-10-15 00:11:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:11:42,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2024-10-15 00:11:42,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:11:42,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-15 00:11:42,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2024-10-15 00:11:42,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:42,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-10-15 00:11:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2024-10-15 00:11:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-10-15 00:11:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 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) [2024-10-15 00:11:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2024-10-15 00:11:42,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-10-15 00:11:42,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-10-15 00:11:42,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:11:42,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2024-10-15 00:11:42,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-15 00:11:42,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:42,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:42,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:42,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:42,291 INFO L745 eck$LassoCheckResult]: Stem: 851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 863#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 903#L14 assume !(0 == main_~i~0#1); 904#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 861#L17-1 assume !(1 == main_~up~0#1); 862#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 894#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 917#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 916#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2024-10-15 00:11:42,291 INFO L747 eck$LassoCheckResult]: Loop: 915#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 914#L20-1 assume !(0 == main_~up~0#1); 857#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 882#L14 assume !(0 == main_~i~0#1); 880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2024-10-15 00:11:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2024-10-15 00:11:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029850441] [2024-10-15 00:11:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029850441] [2024-10-15 00:11:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029850441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929931467] [2024-10-15 00:11:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-15 00:11:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:42,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:11:42,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:42,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929931467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:42,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-15 00:11:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867690705] [2024-10-15 00:11:42,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:42,439 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:42,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2024-10-15 00:11:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696719341] [2024-10-15 00:11:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:42,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:42,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:42,503 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:42,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:42,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:42,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:42,503 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:42,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,503 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:42,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:42,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-10-15 00:11:42,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:42,504 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:42,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:42,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:42,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:42,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:42,630 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:42,630 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:42,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:11:42,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:42,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:42,663 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:42,664 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:42,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-15 00:11:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,681 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:11:42,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:42,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:42,700 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:42,700 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: [] [2024-10-15 00:11:42,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-15 00:11:42,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,718 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:11:42,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:42,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:42,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-15 00:11:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:42,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:42,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:11:42,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:42,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:42,990 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:42,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:11:42,997 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:42,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:42,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:42,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:42,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:42,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:42,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:42,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:42,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-10-15 00:11:42,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:42,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:42,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:43,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:43,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:43,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:43,116 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:43,116 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:43,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:43,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:43,118 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:43,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:11:43,119 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 [2024-10-15 00:11:43,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:43,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:43,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:43,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:43,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:43,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:43,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:43,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:43,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-15 00:11:43,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:43,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:43,152 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:43,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:11:43,154 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 [2024-10-15 00:11:43,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:43,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:43,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:43,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:43,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:43,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:43,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:43,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:43,192 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:43,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:11:43,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:43,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:43,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:43,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:43,205 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:43,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:43,207 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:43,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:43,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:43,214 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-15 00:11:43,215 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-15 00:11:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:43,217 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:11:43,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:43,220 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:43,220 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:43,220 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2024-10-15 00:11:43,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-15 00:11:43,236 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:43,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:11:43,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 136 transitions. Complement of second has 7 states. [2024-10-15 00:11:43,353 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 [2024-10-15 00:11:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-10-15 00:11:43,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-15 00:11:43,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:43,355 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:11:43,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-15 00:11:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:43,466 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:11:43,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 174 transitions. Complement of second has 9 states. [2024-10-15 00:11:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2024-10-15 00:11:43,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-15 00:11:43,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:43,511 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:43,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:43,584 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:11:43,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 165 transitions. Complement of second has 8 states. [2024-10-15 00:11:43,621 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 [2024-10-15 00:11:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2024-10-15 00:11:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-15 00:11:43,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:43,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2024-10-15 00:11:43,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:43,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2024-10-15 00:11:43,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:43,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2024-10-15 00:11:43,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-10-15 00:11:43,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2024-10-15 00:11:43,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:11:43,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-15 00:11:43,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2024-10-15 00:11:43,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:43,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-15 00:11:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2024-10-15 00:11:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2024-10-15 00:11:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 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) [2024-10-15 00:11:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-10-15 00:11:43,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-10-15 00:11:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:11:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:11:43,636 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:43,727 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2024-10-15 00:11:43,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2024-10-15 00:11:43,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-10-15 00:11:43,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2024-10-15 00:11:43,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-15 00:11:43,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-15 00:11:43,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2024-10-15 00:11:43,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:43,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2024-10-15 00:11:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2024-10-15 00:11:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2024-10-15 00:11:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 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) [2024-10-15 00:11:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2024-10-15 00:11:43,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-15 00:11:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:11:43,747 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-15 00:11:43,747 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:11:43,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2024-10-15 00:11:43,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-10-15 00:11:43,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:43,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:43,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:11:43,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-15 00:11:43,754 INFO L745 eck$LassoCheckResult]: Stem: 1785#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1786#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1791#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1869#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1868#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2024-10-15 00:11:43,754 INFO L747 eck$LassoCheckResult]: Loop: 1851#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1864#L20-1 assume !(0 == main_~up~0#1); 1862#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1853#L14 assume !(0 == main_~i~0#1); 1850#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1840#L17-1 assume !(1 == main_~up~0#1); 1848#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1849#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1847#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1845#L14 assume !(0 == main_~i~0#1); 1839#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1836#L17-1 assume !(1 == main_~up~0#1); 1834#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1831#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1832#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1844#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2024-10-15 00:11:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2024-10-15 00:11:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656097] [2024-10-15 00:11:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:43,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:43,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2024-10-15 00:11:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988624984] [2024-10-15 00:11:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988624984] [2024-10-15 00:11:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988624984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579806590] [2024-10-15 00:11:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:43,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:43,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:43,922 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:43,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-15 00:11:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:43,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:11:43,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:43,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579806590] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:44,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2024-10-15 00:11:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345502982] [2024-10-15 00:11:44,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:44,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 00:11:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-15 00:11:44,026 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:44,175 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-10-15 00:11:44,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2024-10-15 00:11:44,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-15 00:11:44,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2024-10-15 00:11:44,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-10-15 00:11:44,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-10-15 00:11:44,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2024-10-15 00:11:44,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:44,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-10-15 00:11:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2024-10-15 00:11:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-10-15 00:11:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 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) [2024-10-15 00:11:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-10-15 00:11:44,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-10-15 00:11:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:11:44,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-10-15 00:11:44,186 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:11:44,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2024-10-15 00:11:44,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:44,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:44,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:44,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2024-10-15 00:11:44,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:44,191 INFO L745 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2204#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2230#L14 assume !(0 == main_~i~0#1); 2228#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2226#L17-1 assume !(1 == main_~up~0#1); 2224#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2219#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2196#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2197#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume !(1 == main_~up~0#1); 2208#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2217#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2248#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2258#L14 assume !(0 == main_~i~0#1); 2256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2254#L17-1 assume !(1 == main_~up~0#1); 2251#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2246#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2247#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2242#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2024-10-15 00:11:44,191 INFO L747 eck$LassoCheckResult]: Loop: 2243#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2205#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2206#L20-1 assume !(0 == main_~up~0#1); 2274#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2273#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2272#L14 assume !(0 == main_~i~0#1); 2270#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2269#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2250#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2244#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2245#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2024-10-15 00:11:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2024-10-15 00:11:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384826204] [2024-10-15 00:11:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384826204] [2024-10-15 00:11:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384826204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554947495] [2024-10-15 00:11:44,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:11:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:44,286 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:44,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-15 00:11:44,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:11:44,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:44,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:11:44,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554947495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:44,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-15 00:11:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20880428] [2024-10-15 00:11:44,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:44,438 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2024-10-15 00:11:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552490529] [2024-10-15 00:11:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:44,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:44,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 00:11:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-15 00:11:44,519 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 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) [2024-10-15 00:11:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:44,669 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-10-15 00:11:44,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2024-10-15 00:11:44,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:44,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2024-10-15 00:11:44,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-10-15 00:11:44,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2024-10-15 00:11:44,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2024-10-15 00:11:44,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:44,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-10-15 00:11:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2024-10-15 00:11:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-10-15 00:11:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 136 states have internal predecessors, (149), 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) [2024-10-15 00:11:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-10-15 00:11:44,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-10-15 00:11:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 00:11:44,682 INFO L425 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-10-15 00:11:44,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:11:44,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2024-10-15 00:11:44,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:44,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:44,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:44,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2024-10-15 00:11:44,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:44,684 INFO L745 eck$LassoCheckResult]: Stem: 2604#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2605#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2616#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2639#L14 assume !(0 == main_~i~0#1); 2636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2633#L17-1 assume !(1 == main_~up~0#1); 2630#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2625#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2624#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2726#L14 assume !(0 == main_~i~0#1); 2621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume !(1 == main_~up~0#1); 2613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2622#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2723#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2722#L14 assume !(0 == main_~i~0#1); 2721#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2720#L17-1 assume !(1 == main_~up~0#1); 2719#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2718#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2717#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2716#L14 assume !(0 == main_~i~0#1); 2715#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2714#L17-1 assume !(1 == main_~up~0#1); 2713#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2712#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2711#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2710#L14 assume !(0 == main_~i~0#1); 2709#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2708#L17-1 assume !(1 == main_~up~0#1); 2707#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2706#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2705#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2704#L14 assume !(0 == main_~i~0#1); 2703#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2702#L17-1 assume !(1 == main_~up~0#1); 2701#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2700#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2697#L14 assume !(0 == main_~i~0#1); 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2667#L17-1 assume !(1 == main_~up~0#1); 2659#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2654#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2655#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2024-10-15 00:11:44,684 INFO L747 eck$LassoCheckResult]: Loop: 2650#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2610#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2611#L20-1 assume !(0 == main_~up~0#1); 2665#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2663#L14 assume !(0 == main_~i~0#1); 2662#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2661#L17-1 assume !(1 == main_~up~0#1); 2660#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2657#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2651#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2652#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2024-10-15 00:11:44,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2024-10-15 00:11:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554884438] [2024-10-15 00:11:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:44,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554884438] [2024-10-15 00:11:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554884438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135058248] [2024-10-15 00:11:44,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:11:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:44,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:44,842 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:44,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-15 00:11:44,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-15 00:11:44,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:44,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:11:44,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:44,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135058248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:45,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-15 00:11:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508763991] [2024-10-15 00:11:45,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:45,117 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2024-10-15 00:11:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083327021] [2024-10-15 00:11:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:45,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:45,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 00:11:45,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-10-15 00:11:45,177 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 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) [2024-10-15 00:11:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:45,426 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2024-10-15 00:11:45,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2024-10-15 00:11:45,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:45,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2024-10-15 00:11:45,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2024-10-15 00:11:45,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2024-10-15 00:11:45,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2024-10-15 00:11:45,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:45,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2024-10-15 00:11:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2024-10-15 00:11:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2024-10-15 00:11:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0515021459227467) internal successors, (245), 232 states have internal predecessors, (245), 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) [2024-10-15 00:11:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2024-10-15 00:11:45,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2024-10-15 00:11:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-15 00:11:45,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2024-10-15 00:11:45,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:11:45,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2024-10-15 00:11:45,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:45,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:45,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:45,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2024-10-15 00:11:45,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:45,440 INFO L745 eck$LassoCheckResult]: Stem: 3322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3333#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3348#L14 assume !(0 == main_~i~0#1); 3346#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3345#L17-1 assume !(1 == main_~up~0#1); 3344#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3341#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3340#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3335#L14 assume !(0 == main_~i~0#1); 3336#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3326#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3327#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3538#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3537#L14 assume !(0 == main_~i~0#1); 3536#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3535#L17-1 assume !(1 == main_~up~0#1); 3534#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3533#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3532#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3531#L14 assume !(0 == main_~i~0#1); 3530#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3529#L17-1 assume !(1 == main_~up~0#1); 3528#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3527#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3526#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3525#L14 assume !(0 == main_~i~0#1); 3524#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3523#L17-1 assume !(1 == main_~up~0#1); 3522#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3521#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3520#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3519#L14 assume !(0 == main_~i~0#1); 3518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3517#L17-1 assume !(1 == main_~up~0#1); 3516#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3515#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3513#L14 assume !(0 == main_~i~0#1); 3512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3511#L17-1 assume !(1 == main_~up~0#1); 3510#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3509#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3508#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3507#L14 assume !(0 == main_~i~0#1); 3506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3505#L17-1 assume !(1 == main_~up~0#1); 3504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3503#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3501#L14 assume !(0 == main_~i~0#1); 3500#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3499#L17-1 assume !(1 == main_~up~0#1); 3498#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3497#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3496#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3495#L14 assume !(0 == main_~i~0#1); 3494#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3492#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3491#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3490#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3489#L14 assume !(0 == main_~i~0#1); 3488#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3487#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3485#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3484#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3482#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3481#L17-1 assume !(1 == main_~up~0#1); 3480#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3477#L14 assume !(0 == main_~i~0#1); 3476#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3475#L17-1 assume !(1 == main_~up~0#1); 3474#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3473#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3472#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3471#L14 assume !(0 == main_~i~0#1); 3470#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3469#L17-1 assume !(1 == main_~up~0#1); 3468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3467#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3371#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3390#L14 assume !(0 == main_~i~0#1); 3388#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3383#L17-1 assume !(1 == main_~up~0#1); 3375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3370#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3366#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2024-10-15 00:11:45,440 INFO L747 eck$LassoCheckResult]: Loop: 3367#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3330#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3331#L20-1 assume !(0 == main_~up~0#1); 3382#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3381#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3380#L14 assume !(0 == main_~i~0#1); 3379#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3378#L17-1 assume !(1 == main_~up~0#1); 3377#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3374#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3368#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3369#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2024-10-15 00:11:45,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2024-10-15 00:11:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181597567] [2024-10-15 00:11:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181597567] [2024-10-15 00:11:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181597567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927776992] [2024-10-15 00:11:45,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:11:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:45,842 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:45,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-15 00:11:45,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:11:45,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:45,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 00:11:45,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:46,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927776992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:46,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:46,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2024-10-15 00:11:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917908965] [2024-10-15 00:11:46,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:46,377 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2024-10-15 00:11:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921072967] [2024-10-15 00:11:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:46,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 00:11:46,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2024-10-15 00:11:46,445 INFO L87 Difference]: Start difference. First operand 233 states and 245 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 23 states have internal predecessors, (127), 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) [2024-10-15 00:11:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:46,657 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2024-10-15 00:11:46,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2024-10-15 00:11:46,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:46,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2024-10-15 00:11:46,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2024-10-15 00:11:46,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2024-10-15 00:11:46,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2024-10-15 00:11:46,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:46,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2024-10-15 00:11:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2024-10-15 00:11:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2024-10-15 00:11:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 1.0427046263345197) internal successors, (293), 280 states have internal predecessors, (293), 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) [2024-10-15 00:11:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2024-10-15 00:11:46,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-10-15 00:11:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-15 00:11:46,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-10-15 00:11:46,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:11:46,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2024-10-15 00:11:46,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-15 00:11:46,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:46,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:46,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2024-10-15 00:11:46,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:46,671 INFO L745 eck$LassoCheckResult]: Stem: 4460#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4466#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4486#L14 assume !(0 == main_~i~0#1); 4484#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4483#L17-1 assume !(1 == main_~up~0#1); 4482#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4474#L14 assume !(0 == main_~i~0#1); 4475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4469#L17-1 assume !(1 == main_~up~0#1); 4470#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4476#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4621#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4620#L14 assume !(0 == main_~i~0#1); 4619#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4618#L17-1 assume !(1 == main_~up~0#1); 4617#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4615#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4614#L14 assume !(0 == main_~i~0#1); 4613#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4612#L17-1 assume !(1 == main_~up~0#1); 4611#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4610#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4609#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4608#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4606#L17-1 assume !(1 == main_~up~0#1); 4605#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4604#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4603#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4602#L14 assume !(0 == main_~i~0#1); 4601#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4600#L17-1 assume !(1 == main_~up~0#1); 4599#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4597#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4596#L14 assume !(0 == main_~i~0#1); 4595#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4594#L17-1 assume !(1 == main_~up~0#1); 4593#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4592#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4591#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4590#L14 assume !(0 == main_~i~0#1); 4589#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4588#L17-1 assume !(1 == main_~up~0#1); 4587#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4586#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4585#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4584#L14 assume !(0 == main_~i~0#1); 4583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4582#L17-1 assume !(1 == main_~up~0#1); 4581#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4580#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4578#L14 assume !(0 == main_~i~0#1); 4577#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4576#L17-1 assume !(1 == main_~up~0#1); 4575#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4574#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4572#L14 assume !(0 == main_~i~0#1); 4571#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4570#L17-1 assume !(1 == main_~up~0#1); 4569#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4568#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4567#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4566#L14 assume !(0 == main_~i~0#1); 4565#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4564#L17-1 assume !(1 == main_~up~0#1); 4563#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4562#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4561#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4560#L14 assume !(0 == main_~i~0#1); 4559#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4558#L17-1 assume !(1 == main_~up~0#1); 4557#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4556#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4555#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4554#L14 assume !(0 == main_~i~0#1); 4553#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4552#L17-1 assume !(1 == main_~up~0#1); 4551#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4550#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4549#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4548#L14 assume !(0 == main_~i~0#1); 4547#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4546#L17-1 assume !(1 == main_~up~0#1); 4545#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4544#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4543#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4542#L14 assume !(0 == main_~i~0#1); 4541#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4540#L17-1 assume !(1 == main_~up~0#1); 4539#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4538#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4536#L14 assume !(0 == main_~i~0#1); 4535#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4534#L17-1 assume !(1 == main_~up~0#1); 4533#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4532#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4531#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4530#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4527#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4526#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume !(0 == main_~i~0#1); 4509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume !(1 == main_~up~0#1); 4503#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4500#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4511#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2024-10-15 00:11:46,671 INFO L747 eck$LassoCheckResult]: Loop: 4512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4504#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4505#L20-1 assume !(0 == main_~up~0#1); 4524#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4523#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4522#L14 assume !(0 == main_~i~0#1); 4521#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4520#L17-1 assume !(1 == main_~up~0#1); 4519#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4517#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2024-10-15 00:11:46,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2024-10-15 00:11:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521051606] [2024-10-15 00:11:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:46,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2024-10-15 00:11:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931801299] [2024-10-15 00:11:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2024-10-15 00:11:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253581483] [2024-10-15 00:11:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:46,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:47,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:47,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:11:47 BoogieIcfgContainer [2024-10-15 00:11:47,940 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:11:47,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:11:47,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:11:47,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:11:47,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:39" (3/4) ... [2024-10-15 00:11:47,947 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:11:48,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:11:48,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:11:48,017 INFO L158 Benchmark]: Toolchain (without parser) took 9258.75ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 136.7MB in the beginning and 158.1MB in the end (delta: -21.4MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,018 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:11:48,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.47ms. Allocated memory is still 165.7MB. Free memory was 136.7MB in the beginning and 125.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.23ms. Allocated memory is still 165.7MB. Free memory was 125.4MB in the beginning and 124.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,018 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 123.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:11:48,018 INFO L158 Benchmark]: RCFGBuilder took 238.19ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,019 INFO L158 Benchmark]: BuchiAutomizer took 8679.85ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 164.4MB in the end (delta: -51.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,019 INFO L158 Benchmark]: Witness Printer took 75.76ms. Allocated memory is still 249.6MB. Free memory was 164.4MB in the beginning and 158.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 00:11:48,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.47ms. Allocated memory is still 165.7MB. Free memory was 136.7MB in the beginning and 125.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.23ms. Allocated memory is still 165.7MB. Free memory was 125.4MB in the beginning and 124.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 123.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.19ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8679.85ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 164.4MB in the end (delta: -51.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 75.76ms. Allocated memory is still 249.6MB. Free memory was 164.4MB in the beginning and 158.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. 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 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 6.4s. Construction of modules took 0.6s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 169 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp57 dnf135 smp95 tf106 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 00:11:48,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:48,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:48,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-15 00:11:48,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-15 00:11:49,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)