./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:54:43,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:54:43,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:54:43,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:54:43,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:54:43,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:54:43,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:54:43,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:54:43,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:54:43,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:54:43,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:54:43,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:54:43,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:54:43,281 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:54:43,281 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:54:43,281 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:54:43,282 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:54:43,282 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:54:43,282 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:54:43,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:54:43,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:54:43,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:54:43,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:54:43,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:54:43,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:54:43,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:54:43,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:54:43,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:54:43,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:54:43,289 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:54:43,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:54:43,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:54:43,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:54:43,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:54:43,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:54:43,291 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:54:43,291 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-11-12 20:54:43,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:54:43,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:54:43,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:54:43,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:54:43,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:54:43,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-11-12 20:54:44,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:54:45,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:54:45,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-11-12 20:54:45,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7452d770c/ad3f7febc71b42d291ca82ff0bdf68fa/FLAG13c7b33ac [2024-11-12 20:54:45,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7452d770c/ad3f7febc71b42d291ca82ff0bdf68fa [2024-11-12 20:54:45,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:54:45,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:54:45,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:54:45,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:54:45,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:54:45,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a120e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45, skipping insertion in model container [2024-11-12 20:54:45,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:54:45,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:54:45,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:54:45,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:54:45,782 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:54:45,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45 WrapperNode [2024-11-12 20:54:45,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:54:45,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:54:45,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:54:45,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:54:45,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,805 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-11-12 20:54:45,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:54:45,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:54:45,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:54:45,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:54:45,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,823 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 20:54:45,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:54:45,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:54:45,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:54:45,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:54:45,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (1/1) ... [2024-11-12 20:54:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:45,871 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-11-12 20:54:45,877 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-11-12 20:54:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:54:45,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:54:46,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:54:46,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:54:46,113 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-12 20:54:46,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:54:46,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:54:46,134 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 20:54:46,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:46 BoogieIcfgContainer [2024-11-12 20:54:46,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:54:46,136 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:54:46,136 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:54:46,140 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:54:46,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:46,141 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:54:45" (1/3) ... [2024-11-12 20:54:46,142 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b09d1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:54:46, skipping insertion in model container [2024-11-12 20:54:46,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:46,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:45" (2/3) ... [2024-11-12 20:54:46,143 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b09d1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:54:46, skipping insertion in model container [2024-11-12 20:54:46,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:46,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:46" (3/3) ... [2024-11-12 20:54:46,146 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2024-11-12 20:54:46,214 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:54:46,215 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:54:46,215 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:54:46,215 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:54:46,216 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:54:46,216 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:54:46,216 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:54:46,217 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:54:46,221 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-11-12 20:54:46,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:54:46,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:46,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:46,244 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:54:46,245 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-11-12 20:54:46,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:54:46,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:46,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:46,255 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2024-11-12 20:54:46,255 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2024-11-12 20:54:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 20:54:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238314262] [2024-11-12 20:54:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,361 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:46,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2024-11-12 20:54:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795685656] [2024-11-12 20:54:46,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795685656] [2024-11-12 20:54:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795685656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31615139] [2024-11-12 20:54:46,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:46,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:46,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:54:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:46,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:46,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31615139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:46,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 20:54:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147194957] [2024-11-12 20:54:46,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:46,581 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:54:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:54:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:54:46,618 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-11-12 20:54:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:46,648 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2024-11-12 20:54:46,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2024-11-12 20:54:46,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-12 20:54:46,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions. [2024-11-12 20:54:46,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-12 20:54:46,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-12 20:54:46,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2024-11-12 20:54:46,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:54:46,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-11-12 20:54:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2024-11-12 20:54:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-12 20:54:46,677 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-11-12 20:54:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2024-11-12 20:54:46,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-11-12 20:54:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:54:46,686 INFO L426 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-11-12 20:54:46,687 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:54:46,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2024-11-12 20:54:46,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-12 20:54:46,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:46,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:46,690 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2024-11-12 20:54:46,690 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2024-11-12 20:54:46,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 20:54:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745350296] [2024-11-12 20:54:46,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,699 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035054, now seen corresponding path program 1 times [2024-11-12 20:54:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805341849] [2024-11-12 20:54:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805341849] [2024-11-12 20:54:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805341849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548284514] [2024-11-12 20:54:46,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:46,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:46,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:54:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:46,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:46,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548284514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:46,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 20:54:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218734679] [2024-11-12 20:54:46,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:46,897 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:54:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:54:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:54:46,899 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 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-11-12 20:54:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:46,924 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2024-11-12 20:54:46,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2024-11-12 20:54:46,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-12 20:54:46,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 22 transitions. [2024-11-12 20:54:46,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-12 20:54:46,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-12 20:54:46,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. [2024-11-12 20:54:46,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:54:46,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2024-11-12 20:54:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. [2024-11-12 20:54:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-12 20:54:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-11-12 20:54:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2024-11-12 20:54:46,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2024-11-12 20:54:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:54:46,932 INFO L426 stractBuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2024-11-12 20:54:46,932 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 20:54:46,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. [2024-11-12 20:54:46,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-12 20:54:46,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:46,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:46,934 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2024-11-12 20:54:46,935 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2024-11-12 20:54:46,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 20:54:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081162245] [2024-11-12 20:54:46,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,946 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1217824436, now seen corresponding path program 1 times [2024-11-12 20:54:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617647415] [2024-11-12 20:54:46,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617647415] [2024-11-12 20:54:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617647415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969870919] [2024-11-12 20:54:47,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:47,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:54:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:54:47,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:47,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:47,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969870919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:47,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:47,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 20:54:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120195809] [2024-11-12 20:54:47,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:47,106 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:54:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:47,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:54:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:54:47,107 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. cyclomatic complexity: 9 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-11-12 20:54:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:47,163 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2024-11-12 20:54:47,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2024-11-12 20:54:47,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-11-12 20:54:47,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2024-11-12 20:54:47,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-12 20:54:47,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-12 20:54:47,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2024-11-12 20:54:47,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:54:47,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2024-11-12 20:54:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2024-11-12 20:54:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-12 20:54:47,175 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-11-12 20:54:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-11-12 20:54:47,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-12 20:54:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:54:47,177 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-12 20:54:47,178 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 20:54:47,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-11-12 20:54:47,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-12 20:54:47,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:47,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:47,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:47,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:47,179 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" [2024-11-12 20:54:47,180 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" [2024-11-12 20:54:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-12 20:54:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50233914] [2024-11-12 20:54:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2024-11-12 20:54:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99645356] [2024-11-12 20:54:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,195 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2024-11-12 20:54:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759763972] [2024-11-12 20:54:47,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,214 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:47,311 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:47,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:47,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:47,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:47,313 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:47,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:47,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:47,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-11-12 20:54:47,316 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:47,316 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:47,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:47,478 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,482 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-11-12 20:54:47,487 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-11-12 20:54:47,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:47,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:47,516 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:47,516 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 20:54:47,532 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-11-12 20:54:47,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,534 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-11-12 20:54:47,536 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-11-12 20:54:47,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:47,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:47,561 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:47,561 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 20:54:47,576 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-11-12 20:54:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,579 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-11-12 20:54:47,581 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-11-12 20:54:47,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:47,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:47,616 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-11-12 20:54:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,618 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-11-12 20:54:47,619 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-11-12 20:54:47,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:47,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:47,659 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:47,664 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-11-12 20:54:47,666 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:47,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:47,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:47,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:47,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:47,667 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:47,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:47,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-11-12 20:54:47,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:47,667 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:47,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:47,772 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:47,776 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:47,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,779 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-11-12 20:54:47,780 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-11-12 20:54:47,782 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-11-12 20:54:47,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:47,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:47,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:47,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:47,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:54:47,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:54:47,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:47,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,824 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-11-12 20:54:47,826 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-11-12 20:54:47,827 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-11-12 20:54:47,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:47,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:47,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:47,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:47,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:54:47,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:54:47,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:47,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-12 20:54:47,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,863 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-11-12 20:54:47,864 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-11-12 20:54:47,865 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-11-12 20:54:47,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:47,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:47,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:47,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:47,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:47,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:47,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:47,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:47,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 20:54:47,889 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 20:54:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,893 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-11-12 20:54:47,894 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-11-12 20:54:47,895 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:47,895 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:47,895 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:47,896 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-11-12 20:54:47,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-12 20:54:47,913 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:47,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:47,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:48,010 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-11-12 20:54:48,011 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-11-12 20:54:48,076 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-11-12 20:54:48,079 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-11-12 20:54:48,081 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-11-12 20:54:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-12 20:54:48,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-12 20:54:48,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:48,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2024-11-12 20:54:48,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:48,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2024-11-12 20:54:48,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:48,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2024-11-12 20:54:48,088 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2024-11-12 20:54:48,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2024-11-12 20:54:48,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-12 20:54:48,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-12 20:54:48,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2024-11-12 20:54:48,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:48,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2024-11-12 20:54:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2024-11-12 20:54:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2024-11-12 20:54:48,105 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-11-12 20:54:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2024-11-12 20:54:48,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-11-12 20:54:48,107 INFO L426 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-11-12 20:54:48,107 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 20:54:48,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2024-11-12 20:54:48,111 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2024-11-12 20:54:48,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:48,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:48,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 20:54:48,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:48,111 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" [2024-11-12 20:54:48,111 INFO L749 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" [2024-11-12 20:54:48,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-12 20:54:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731892638] [2024-11-12 20:54:48,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,122 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2024-11-12 20:54:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621681364] [2024-11-12 20:54:48,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,135 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2024-11-12 20:54:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351224618] [2024-11-12 20:54:48,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351224618] [2024-11-12 20:54:48,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351224618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077147717] [2024-11-12 20:54:48,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,180 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:48,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 20:54:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:54:48,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:48,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077147717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:48,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 20:54:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072760820] [2024-11-12 20:54:48,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:48,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:54:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:54:48,287 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-11-12 20:54:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:48,299 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2024-11-12 20:54:48,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2024-11-12 20:54:48,300 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-11-12 20:54:48,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2024-11-12 20:54:48,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-12 20:54:48,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-12 20:54:48,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2024-11-12 20:54:48,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:48,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-11-12 20:54:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2024-11-12 20:54:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-11-12 20:54:48,311 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-11-12 20:54:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-11-12 20:54:48,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-11-12 20:54:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:54:48,313 INFO L426 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-11-12 20:54:48,313 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 20:54:48,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2024-11-12 20:54:48,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2024-11-12 20:54:48,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:48,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:48,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 20:54:48,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:48,315 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:48,315 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" [2024-11-12 20:54:48,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-11-12 20:54:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531505542] [2024-11-12 20:54:48,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,322 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2024-11-12 20:54:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742854703] [2024-11-12 20:54:48,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,335 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2024-11-12 20:54:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039420956] [2024-11-12 20:54:48,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039420956] [2024-11-12 20:54:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039420956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:48,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146771889] [2024-11-12 20:54:48,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:48,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:48,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 20:54:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:54:48,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:48,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146771889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:48,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 20:54:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398636364] [2024-11-12 20:54:48,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:48,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:54:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:54:48,557 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-11-12 20:54:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:48,572 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-12 20:54:48,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2024-11-12 20:54:48,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-12 20:54:48,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2024-11-12 20:54:48,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-12 20:54:48,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-12 20:54:48,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2024-11-12 20:54:48,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:48,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-12 20:54:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2024-11-12 20:54:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-12 20:54:48,580 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-11-12 20:54:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-12 20:54:48,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-12 20:54:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:54:48,585 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-12 20:54:48,587 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 20:54:48,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2024-11-12 20:54:48,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-12 20:54:48,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:48,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:48,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-12 20:54:48,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:48,589 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:48,589 INFO L749 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:48,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-12 20:54:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313130359] [2024-11-12 20:54:48,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,601 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2024-11-12 20:54:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551333752] [2024-11-12 20:54:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,617 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2024-11-12 20:54:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274475930] [2024-11-12 20:54:48,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,633 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,705 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:48,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:48,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:48,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:48,706 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:48,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:48,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:48,707 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-11-12 20:54:48,707 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:48,707 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:48,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:48,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:48,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:48,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:48,857 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:48,857 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:48,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,859 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-11-12 20:54:48,861 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-11-12 20:54:48,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:48,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:48,885 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:48,885 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-11-12 20:54:48,899 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-11-12 20:54:48,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,901 INFO L229 MonitoredProcess]: Starting monitored process 16 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-11-12 20:54:48,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-12 20:54:48,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:48,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:48,914 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:48,914 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-11-12 20:54:48,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,927 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-11-12 20:54:48,928 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-11-12 20:54:48,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:48,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:48,949 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:48,949 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-11-12 20:54:48,960 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-11-12 20:54:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,961 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-11-12 20:54:48,963 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-11-12 20:54:48,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:48,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:48,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,996 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-11-12 20:54:48,997 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-11-12 20:54:48,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:48,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:49,182 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:49,187 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-11-12 20:54:49,187 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:49,187 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:49,187 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:49,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:49,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:49,188 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,188 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:49,188 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:49,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-11-12 20:54:49,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:49,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:49,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,339 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:49,339 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,342 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-11-12 20:54:49,344 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-11-12 20:54:49,345 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-11-12 20:54:49,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:49,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:49,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:49,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:49,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:54:49,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:54:49,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:49,381 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-11-12 20:54:49,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,384 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-11-12 20:54:49,387 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-11-12 20:54:49,388 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-11-12 20:54:49,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:49,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:49,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:49,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:49,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:49,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:49,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:49,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:49,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:49,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,416 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-11-12 20:54:49,417 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-11-12 20:54:49,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:49,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:49,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:49,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:49,428 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-12 20:54:49,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:49,429 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-12 20:54:49,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:49,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:49,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 20:54:49,436 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,438 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-11-12 20:54:49,440 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-11-12 20:54:49,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:49,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:49,441 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:49,441 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-11-12 20:54:49,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-12 20:54:49,452 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:49,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:49,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:49,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:54:49,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:49,524 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-11-12 20:54:49,524 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-11-12 20:54:49,558 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-11-12 20:54:49,559 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-11-12 20:54:49,559 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-11-12 20:54:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-12 20:54:49,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-12 20:54:49,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:49,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-12 20:54:49,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:49,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2024-11-12 20:54:49,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:49,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2024-11-12 20:54:49,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-12 20:54:49,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2024-11-12 20:54:49,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-12 20:54:49,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-12 20:54:49,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2024-11-12 20:54:49,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:49,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-12 20:54:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2024-11-12 20:54:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-12 20:54:49,568 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-11-12 20:54:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2024-11-12 20:54:49,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-11-12 20:54:49,569 INFO L426 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-11-12 20:54:49,569 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 20:54:49,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2024-11-12 20:54:49,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-12 20:54:49,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:49,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:49,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:49,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:54:49,570 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:49,570 INFO L749 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2024-11-12 20:54:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602093754] [2024-11-12 20:54:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602093754] [2024-11-12 20:54:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602093754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466961540] [2024-11-12 20:54:49,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,604 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:49,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-12 20:54:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:49,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:54:49,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:49,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466961540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:49,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-12 20:54:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450590069] [2024-11-12 20:54:49,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:49,695 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:49,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2024-11-12 20:54:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:49,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174020634] [2024-11-12 20:54:49,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:49,702 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:49,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:49,771 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:49,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:49,771 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:49,771 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:49,771 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:49,771 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,771 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:49,771 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:49,771 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-11-12 20:54:49,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:49,772 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:49,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:49,890 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:49,891 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,892 INFO L229 MonitoredProcess]: Starting monitored process 25 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-11-12 20:54:49,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-12 20:54:49,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:49,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:49,913 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:49,913 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-11-12 20:54:49,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-12 20:54:49,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,925 INFO L229 MonitoredProcess]: Starting monitored process 26 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-11-12 20:54:49,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-12 20:54:49,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:49,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:49,941 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:49,941 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-11-12 20:54:49,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-12 20:54:49,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,957 INFO L229 MonitoredProcess]: Starting monitored process 27 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-11-12 20:54:49,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-12 20:54:49,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:49,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:49,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:49,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:49,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,981 INFO L229 MonitoredProcess]: Starting monitored process 28 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-11-12 20:54:49,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-12 20:54:49,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:49,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:50,139 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:50,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:50,146 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:50,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:50,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:50,146 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:50,146 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:50,146 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:50,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:50,146 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:50,146 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-11-12 20:54:50,146 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:50,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:50,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:50,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:50,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:50,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:50,258 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:50,258 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:50,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:50,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:50,260 INFO L229 MonitoredProcess]: Starting monitored process 29 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-11-12 20:54:50,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-12 20:54:50,262 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-11-12 20:54:50,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:50,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:50,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:50,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:50,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:54:50,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:54:50,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:50,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:50,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:50,291 INFO L229 MonitoredProcess]: Starting monitored process 30 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-11-12 20:54:50,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-12 20:54:50,292 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-11-12 20:54:50,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:50,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:50,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:50,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:50,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:50,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:50,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:50,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:50,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-12 20:54:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:50,316 INFO L229 MonitoredProcess]: Starting monitored process 31 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-11-12 20:54:50,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-12 20:54:50,318 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-11-12 20:54:50,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:50,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:50,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:50,328 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-12 20:54:50,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:50,330 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-12 20:54:50,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:50,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:50,337 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 20:54:50,337 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:50,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:50,339 INFO L229 MonitoredProcess]: Starting monitored process 32 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-11-12 20:54:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-12 20:54:50,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:50,344 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:50,344 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:50,344 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-12 20:54:50,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-12 20:54:50,360 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,438 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-11-12 20:54:50,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:50,460 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-11-12 20:54:50,460 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-11-12 20:54:50,493 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-11-12 20:54:50,493 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-11-12 20:54:50,494 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-11-12 20:54:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-12 20:54:50,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-12 20:54:50,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:50,495 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:50,565 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-11-12 20:54:50,565 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-11-12 20:54:50,617 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-11-12 20:54:50,617 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-11-12 20:54:50,618 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-11-12 20:54:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2024-11-12 20:54:50,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-12 20:54:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:50,619 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:50,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:50,693 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-11-12 20:54:50,693 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-11-12 20:54:50,732 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-11-12 20:54:50,736 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-11-12 20:54:50,736 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-11-12 20:54:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2024-11-12 20:54:50,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-12 20:54:50,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:50,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2024-11-12 20:54:50,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:50,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2024-11-12 20:54:50,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:50,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2024-11-12 20:54:50,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-12 20:54:50,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2024-11-12 20:54:50,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-12 20:54:50,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-12 20:54:50,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2024-11-12 20:54:50,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:50,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-12 20:54:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2024-11-12 20:54:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2024-11-12 20:54:50,748 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-11-12 20:54:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 20:54:50,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 20:54:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:54:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:54:50,750 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-11-12 20:54:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:50,816 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2024-11-12 20:54:50,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2024-11-12 20:54:50,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2024-11-12 20:54:50,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2024-11-12 20:54:50,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-12 20:54:50,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-12 20:54:50,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2024-11-12 20:54:50,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:50,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2024-11-12 20:54:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2024-11-12 20:54:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2024-11-12 20:54:50,833 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-11-12 20:54:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2024-11-12 20:54:50,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-11-12 20:54:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 20:54:50,835 INFO L426 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-11-12 20:54:50,836 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 20:54:50,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2024-11-12 20:54:50,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-11-12 20:54:50,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:50,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:50,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-12 20:54:50,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 20:54:50,838 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:50,838 INFO L749 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2024-11-12 20:54:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2024-11-12 20:54:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374036710] [2024-11-12 20:54:50,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:50,845 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:50,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2024-11-12 20:54:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112125932] [2024-11-12 20:54:50,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112125932] [2024-11-12 20:54:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112125932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945660421] [2024-11-12 20:54:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:51,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:51,005 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:51,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-12 20:54:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:54:51,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:51,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945660421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:51,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2024-11-12 20:54:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452194114] [2024-11-12 20:54:51,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:51,096 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:54:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:54:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:54:51,097 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-11-12 20:54:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:51,254 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-11-12 20:54:51,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2024-11-12 20:54:51,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-12 20:54:51,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2024-11-12 20:54:51,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-12 20:54:51,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-12 20:54:51,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2024-11-12 20:54:51,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:51,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-11-12 20:54:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2024-11-12 20:54:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-11-12 20:54:51,265 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-11-12 20:54:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-11-12 20:54:51,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-12 20:54:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:54:51,267 INFO L426 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-12 20:54:51,267 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 20:54:51,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2024-11-12 20:54:51,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:51,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:51,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:51,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2024-11-12 20:54:51,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:51,273 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,273 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2024-11-12 20:54:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577424608] [2024-11-12 20:54:51,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577424608] [2024-11-12 20:54:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577424608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537140687] [2024-11-12 20:54:51,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:54:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:51,341 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:51,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-12 20:54:51,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:51,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-12 20:54:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571866571] [2024-11-12 20:54:51,370 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:51,371 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:51,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2024-11-12 20:54:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693495869] [2024-11-12 20:54:51,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,377 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:54:51,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:54:51,438 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-11-12 20:54:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:51,509 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-12 20:54:51,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 129 transitions. [2024-11-12 20:54:51,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:51,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 115 states and 127 transitions. [2024-11-12 20:54:51,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-12 20:54:51,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-12 20:54:51,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 127 transitions. [2024-11-12 20:54:51,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:51,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-12 20:54:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 127 transitions. [2024-11-12 20:54:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2024-11-12 20:54:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.118811881188119) internal successors, (113), 100 states have internal predecessors, (113), 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-11-12 20:54:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-11-12 20:54:51,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-12 20:54:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:54:51,520 INFO L426 stractBuchiCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-12 20:54:51,520 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 20:54:51,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 113 transitions. [2024-11-12 20:54:51,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:51,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:51,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:51,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-12 20:54:51,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:51,521 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,521 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2102993578, now seen corresponding path program 3 times [2024-11-12 20:54:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445639367] [2024-11-12 20:54:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:51,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:51,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445639367] [2024-11-12 20:54:51,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445639367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:51,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488960528] [2024-11-12 20:54:51,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:54:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:51,616 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:51,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-12 20:54:51,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:51,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-12 20:54:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500017180] [2024-11-12 20:54:51,645 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:51,645 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2024-11-12 20:54:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933990973] [2024-11-12 20:54:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,650 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:54:51,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:54:51,705 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-11-12 20:54:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:51,806 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2024-11-12 20:54:51,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 141 transitions. [2024-11-12 20:54:51,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:51,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 139 transitions. [2024-11-12 20:54:51,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-12 20:54:51,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-12 20:54:51,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 139 transitions. [2024-11-12 20:54:51,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:51,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 139 transitions. [2024-11-12 20:54:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 139 transitions. [2024-11-12 20:54:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2024-11-12 20:54:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.1061946902654867) internal successors, (125), 112 states have internal predecessors, (125), 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-11-12 20:54:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-12 20:54:51,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-12 20:54:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:54:51,813 INFO L426 stractBuchiCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-12 20:54:51,813 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 20:54:51,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 125 transitions. [2024-11-12 20:54:51,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:51,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:51,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:51,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1] [2024-11-12 20:54:51,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:51,814 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,814 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1672757925, now seen corresponding path program 4 times [2024-11-12 20:54:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609552643] [2024-11-12 20:54:51,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609552643] [2024-11-12 20:54:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609552643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686843408] [2024-11-12 20:54:51,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 20:54:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:51,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:51,894 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:51,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-12 20:54:51,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:51,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:51,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 20:54:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288365705] [2024-11-12 20:54:51,921 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:51,921 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2024-11-12 20:54:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508717549] [2024-11-12 20:54:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,926 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:54:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:54:51,980 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:52,073 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2024-11-12 20:54:52,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 153 transitions. [2024-11-12 20:54:52,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 151 transitions. [2024-11-12 20:54:52,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2024-11-12 20:54:52,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-12 20:54:52,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 151 transitions. [2024-11-12 20:54:52,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:52,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-12 20:54:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 151 transitions. [2024-11-12 20:54:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2024-11-12 20:54:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.096) internal successors, (137), 124 states have internal predecessors, (137), 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-11-12 20:54:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-12 20:54:52,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-12 20:54:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 20:54:52,079 INFO L426 stractBuchiCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-12 20:54:52,079 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-12 20:54:52,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 137 transitions. [2024-11-12 20:54:52,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:52,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:52,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-12 20:54:52,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:52,081 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,081 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1351733068, now seen corresponding path program 5 times [2024-11-12 20:54:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47202220] [2024-11-12 20:54:52,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47202220] [2024-11-12 20:54:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47202220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314073246] [2024-11-12 20:54:52,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 20:54:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:52,183 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-12 20:54:52,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:52,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:52,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-12 20:54:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942447776] [2024-11-12 20:54:52,212 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:52,213 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2024-11-12 20:54:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814447858] [2024-11-12 20:54:52,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:52,217 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:52,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:54:52,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:54:52,270 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. cyclomatic complexity: 16 Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 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-11-12 20:54:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:52,370 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2024-11-12 20:54:52,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 165 transitions. [2024-11-12 20:54:52,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 151 states and 163 transitions. [2024-11-12 20:54:52,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-11-12 20:54:52,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2024-11-12 20:54:52,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2024-11-12 20:54:52,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:52,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-12 20:54:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2024-11-12 20:54:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-11-12 20:54:52,376 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-11-12 20:54:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-12 20:54:52,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-12 20:54:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 20:54:52,377 INFO L426 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-12 20:54:52,377 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-12 20:54:52,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2024-11-12 20:54:52,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:52,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:52,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2024-11-12 20:54:52,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:52,380 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,380 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 6 times [2024-11-12 20:54:52,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111505464] [2024-11-12 20:54:52,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111505464] [2024-11-12 20:54:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111505464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874913436] [2024-11-12 20:54:52,491 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 20:54:52,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:52,493 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:52,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-12 20:54:52,521 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:52,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:52,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 20:54:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857481297] [2024-11-12 20:54:52,521 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:52,522 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:52,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 6 times [2024-11-12 20:54:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487799935] [2024-11-12 20:54:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:52,529 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:52,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:54:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:54:52,590 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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-11-12 20:54:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:52,701 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2024-11-12 20:54:52,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 177 transitions. [2024-11-12 20:54:52,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 163 states and 175 transitions. [2024-11-12 20:54:52,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-12 20:54:52,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-12 20:54:52,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 175 transitions. [2024-11-12 20:54:52,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:52,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 175 transitions. [2024-11-12 20:54:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 175 transitions. [2024-11-12 20:54:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2024-11-12 20:54:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.080536912751678) internal successors, (161), 148 states have internal predecessors, (161), 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-11-12 20:54:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2024-11-12 20:54:52,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 161 transitions. [2024-11-12 20:54:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 20:54:52,708 INFO L426 stractBuchiCegarLoop]: Abstraction has 149 states and 161 transitions. [2024-11-12 20:54:52,708 INFO L333 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-12 20:54:52,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 161 transitions. [2024-11-12 20:54:52,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:52,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:52,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:52,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1] [2024-11-12 20:54:52,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:52,711 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,711 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 118659310, now seen corresponding path program 7 times [2024-11-12 20:54:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780435826] [2024-11-12 20:54:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:52,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:52,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780435826] [2024-11-12 20:54:52,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780435826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:52,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535257004] [2024-11-12 20:54:52,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 20:54:52,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:52,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:52,869 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:52,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-12 20:54:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:52,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 20:54:52,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:52,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535257004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:53,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-12 20:54:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255498220] [2024-11-12 20:54:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:53,164 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 7 times [2024-11-12 20:54:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056635319] [2024-11-12 20:54:53,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:53,167 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:53,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 20:54:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2024-11-12 20:54:53,228 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. cyclomatic complexity: 16 Second operand has 21 states, 20 states have (on average 5.5) internal successors, (110), 21 states have internal predecessors, (110), 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-11-12 20:54:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:53,493 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2024-11-12 20:54:53,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 301 transitions. [2024-11-12 20:54:53,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:53,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 271 states and 283 transitions. [2024-11-12 20:54:53,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2024-11-12 20:54:53,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2024-11-12 20:54:53,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 283 transitions. [2024-11-12 20:54:53,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:53,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 283 transitions. [2024-11-12 20:54:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 283 transitions. [2024-11-12 20:54:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 257. [2024-11-12 20:54:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.046692607003891) internal successors, (269), 256 states have internal predecessors, (269), 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-11-12 20:54:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 269 transitions. [2024-11-12 20:54:53,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 269 transitions. [2024-11-12 20:54:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 20:54:53,502 INFO L426 stractBuchiCegarLoop]: Abstraction has 257 states and 269 transitions. [2024-11-12 20:54:53,502 INFO L333 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-12 20:54:53,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 269 transitions. [2024-11-12 20:54:53,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:53,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:53,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:53,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 17, 17, 17, 17, 17, 1, 1, 1] [2024-11-12 20:54:53,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:53,505 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:53,505 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -58445017, now seen corresponding path program 8 times [2024-11-12 20:54:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039346667] [2024-11-12 20:54:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039346667] [2024-11-12 20:54:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039346667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239276900] [2024-11-12 20:54:53,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:54:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:53,903 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:53,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-12 20:54:53,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:53,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-11-12 20:54:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883388106] [2024-11-12 20:54:53,937 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:53,937 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 8 times [2024-11-12 20:54:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955022650] [2024-11-12 20:54:53,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:53,941 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:53,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 20:54:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2024-11-12 20:54:53,995 INFO L87 Difference]: Start difference. First operand 257 states and 269 transitions. cyclomatic complexity: 16 Second operand has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:54,160 INFO L93 Difference]: Finished difference Result 285 states and 297 transitions. [2024-11-12 20:54:54,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 297 transitions. [2024-11-12 20:54:54,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:54,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 283 states and 295 transitions. [2024-11-12 20:54:54,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2024-11-12 20:54:54,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2024-11-12 20:54:54,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 295 transitions. [2024-11-12 20:54:54,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:54,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 295 transitions. [2024-11-12 20:54:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 295 transitions. [2024-11-12 20:54:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2024-11-12 20:54:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 1.0446096654275092) internal successors, (281), 268 states have internal predecessors, (281), 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-11-12 20:54:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 281 transitions. [2024-11-12 20:54:54,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 281 transitions. [2024-11-12 20:54:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 20:54:54,169 INFO L426 stractBuchiCegarLoop]: Abstraction has 269 states and 281 transitions. [2024-11-12 20:54:54,169 INFO L333 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-12 20:54:54,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 281 transitions. [2024-11-12 20:54:54,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:54,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:54,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:54,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 18, 18, 1, 1, 1] [2024-11-12 20:54:54,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:54,172 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:54,172 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 123059224, now seen corresponding path program 9 times [2024-11-12 20:54:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-11-12 20:54:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:54,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-11-12 20:54:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924299993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454695174] [2024-11-12 20:54:54,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:54:54,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:54,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:54,625 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:54,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-12 20:54:54,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:54,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2024-11-12 20:54:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023439555] [2024-11-12 20:54:54,655 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:54,655 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 9 times [2024-11-12 20:54:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886642958] [2024-11-12 20:54:54,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,658 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 20:54:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2024-11-12 20:54:54,708 INFO L87 Difference]: Start difference. First operand 269 states and 281 transitions. cyclomatic complexity: 16 Second operand has 21 states, 20 states have (on average 5.6) internal successors, (112), 21 states have internal predecessors, (112), 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-11-12 20:54:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:54,878 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2024-11-12 20:54:54,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 309 transitions. [2024-11-12 20:54:54,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:54,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 295 states and 307 transitions. [2024-11-12 20:54:54,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2024-11-12 20:54:54,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2024-11-12 20:54:54,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2024-11-12 20:54:54,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:54,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2024-11-12 20:54:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2024-11-12 20:54:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2024-11-12 20:54:54,885 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-11-12 20:54:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2024-11-12 20:54:54,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-11-12 20:54:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 20:54:54,887 INFO L426 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2024-11-12 20:54:54,887 INFO L333 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-12 20:54:54,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2024-11-12 20:54:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-12 20:54:54,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:54,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:54,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2024-11-12 20:54:54,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:54:54,889 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:54,889 INFO L749 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2024-11-12 20:54:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 10 times [2024-11-12 20:54:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527806259] [2024-11-12 20:54:54,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,909 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:54,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 10 times [2024-11-12 20:54:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110182754] [2024-11-12 20:54:54,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,943 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2024-11-12 20:54:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584082550] [2024-11-12 20:54:54,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,963 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:55,906 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:56,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 08:54:56 BoogieIcfgContainer [2024-11-12 20:54:56,003 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 20:54:56,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:54:56,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:54:56,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:54:56,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:46" (3/4) ... [2024-11-12 20:54:56,006 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 20:54:56,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 20:54:56,075 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:54:56,075 INFO L158 Benchmark]: Toolchain (without parser) took 10507.92ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.6MB in the beginning and 86.4MB in the end (delta: 43.2MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,075 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 125.8MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:54:56,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.77ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 117.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.58ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 116.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,076 INFO L158 Benchmark]: Boogie Preprocessor took 30.05ms. Allocated memory is still 161.5MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:54:56,076 INFO L158 Benchmark]: RCFGBuilder took 298.59ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 105.8MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,077 INFO L158 Benchmark]: BuchiAutomizer took 9866.92ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 105.8MB in the beginning and 92.7MB in the end (delta: 13.0MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,077 INFO L158 Benchmark]: Witness Printer took 71.15ms. Allocated memory is still 195.0MB. Free memory was 92.7MB in the beginning and 86.4MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 20:54:56,078 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.54ms. Allocated memory is still 125.8MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.77ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 117.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.58ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 116.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.05ms. Allocated memory is still 161.5MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.59ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 105.8MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9866.92ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 105.8MB in the beginning and 92.7MB in the end (delta: 13.0MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 71.15ms. Allocated memory is still 195.0MB. Free memory was 92.7MB in the beginning and 86.4MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (15 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. 15 modules have a trivial ranking function, the largest among these consists of 21 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 18 iterations. TraceHistogramMax:20. Analysis of lassos took 7.2s. Construction of modules took 0.8s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 16 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, 727 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1183 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 210 mSDtfsCounter, 1183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN8 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: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 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-11-12 20:54:56,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-12 20:54:56,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-12 20:54:56,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-12 20:54:57,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:57,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-12 20:54:57,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:57,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-12 20:54:57,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-12 20:54:58,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 20:54:58,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:58,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 20:54:58,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:58,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:59,131 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)