./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:03:53,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:03:53,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:03:53,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:03:53,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:03:53,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:03:54,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:03:54,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:03:54,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:03:54,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:03:54,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:03:54,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:03:54,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:03:54,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:03:54,011 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:03:54,011 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:03:54,012 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:03:54,015 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:03:54,015 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:03:54,015 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:03:54,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:03:54,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:03:54,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:03:54,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:03:54,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:03:54,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:03:54,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:03:54,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:03:54,020 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:03:54,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:03:54,020 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:03:54,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:03:54,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:03:54,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:03:54,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:03:54,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:03:54,022 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:03:54,022 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-17 08:03:54,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:03:54,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:03:54,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:03:54,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:03:54,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:03:54,346 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-17 08:03:55,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:03:55,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:03:55,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2024-11-17 08:03:55,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6356bc5bc/9187649d87684c8ea32903b5b303affa/FLAG465609b3d [2024-11-17 08:03:55,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6356bc5bc/9187649d87684c8ea32903b5b303affa [2024-11-17 08:03:55,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:03:55,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:03:55,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:03:55,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:03:55,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:03:55,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:03:55" (1/1) ... [2024-11-17 08:03:55,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f514605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:55, skipping insertion in model container [2024-11-17 08:03:55,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:03:55" (1/1) ... [2024-11-17 08:03:55,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:03:56,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:03:56,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:03:56,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:03:56,227 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:03:56,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56 WrapperNode [2024-11-17 08:03:56,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:03:56,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:03:56,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:03:56,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:03:56,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,258 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2024-11-17 08:03:56,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:03:56,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:03:56,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:03:56,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:03:56,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,277 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 08:03:56,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:03:56,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:03:56,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:03:56,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:03:56,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (1/1) ... [2024-11-17 08:03:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:56,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:56,323 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-17 08:03:56,330 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-17 08:03:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:03:56,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:03:56,463 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:03:56,465 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:03:56,556 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-17 08:03:56,556 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:03:56,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:03:56,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:03:56,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:56 BoogieIcfgContainer [2024-11-17 08:03:56,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:03:56,575 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:03:56,575 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:03:56,579 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:03:56,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:56,581 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:03:55" (1/3) ... [2024-11-17 08:03:56,582 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab59715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:03:56, skipping insertion in model container [2024-11-17 08:03:56,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:56,582 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:56" (2/3) ... [2024-11-17 08:03:56,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab59715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:03:56, skipping insertion in model container [2024-11-17 08:03:56,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:56,584 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:56" (3/3) ... [2024-11-17 08:03:56,587 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2024-11-17 08:03:56,688 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:03:56,688 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:03:56,688 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:03:56,689 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:03:56,689 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:03:56,689 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:03:56,689 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:03:56,690 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:03:56,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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-17 08:03:56,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:03:56,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:56,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:56,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:56,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:56,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:03:56,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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-17 08:03:56,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:03:56,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:56,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:56,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:56,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:56,791 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#ULTIMATE.init_returnLabel#1true assume 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; 9#L13true [2024-11-17 08:03:56,791 INFO L747 eck$LassoCheckResult]: Loop: 9#L13true assume true; 7#L13-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6#L14true assume 0 == main_~i~0#1;main_~up~0#1 := 1; 8#L17true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 13#L20true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11#L23true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5#L26true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9#L13true [2024-11-17 08:03:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2024-11-17 08:03:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226002182] [2024-11-17 08:03:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:56,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:56,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1713261785, now seen corresponding path program 1 times [2024-11-17 08:03:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101091990] [2024-11-17 08:03:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:57,038 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-17 08:03:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101091990] [2024-11-17 08:03:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101091990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:03:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198607460] [2024-11-17 08:03:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:57,046 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:03:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:03:57,079 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:57,112 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2024-11-17 08:03:57,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. [2024-11-17 08:03:57,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-17 08:03:57,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 25 transitions. [2024-11-17 08:03:57,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:03:57,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:03:57,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2024-11-17 08:03:57,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:03:57,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 25 transitions. [2024-11-17 08:03:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2024-11-17 08:03:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:03:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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-17 08:03:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2024-11-17 08:03:57,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 25 transitions. [2024-11-17 08:03:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:03:57,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2024-11-17 08:03:57,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:03:57,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 25 transitions. [2024-11-17 08:03:57,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-17 08:03:57,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:57,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:57,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:57,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:57,157 INFO L745 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 51#ULTIMATE.init_returnLabel#1 assume 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; 49#L13 [2024-11-17 08:03:57,157 INFO L747 eck$LassoCheckResult]: Loop: 49#L13 assume true; 44#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 45#L14 assume !(0 == main_~i~0#1); 56#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 47#L20 assume !(1 == main_~up~0#1); 52#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 53#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 49#L13 [2024-11-17 08:03:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times [2024-11-17 08:03:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475171980] [2024-11-17 08:03:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1712337303, now seen corresponding path program 1 times [2024-11-17 08:03:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919118874] [2024-11-17 08:03:57,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:57,242 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-17 08:03:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919118874] [2024-11-17 08:03:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919118874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:57,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:03:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598817646] [2024-11-17 08:03:57,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:57,245 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:03:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:03:57,246 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:57,314 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2024-11-17 08:03:57,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 67 transitions. [2024-11-17 08:03:57,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2024-11-17 08:03:57,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 67 transitions. [2024-11-17 08:03:57,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:03:57,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-17 08:03:57,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. [2024-11-17 08:03:57,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:03:57,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-11-17 08:03:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. [2024-11-17 08:03:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-17 08:03:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 states have internal predecessors, (67), 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-17 08:03:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-11-17 08:03:57,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-11-17 08:03:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:03:57,329 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-11-17 08:03:57,329 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:03:57,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 67 transitions. [2024-11-17 08:03:57,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2024-11-17 08:03:57,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:57,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:57,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:57,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:57,331 INFO L745 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 116#ULTIMATE.init_returnLabel#1 assume 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; 118#L13 [2024-11-17 08:03:57,331 INFO L747 eck$LassoCheckResult]: Loop: 118#L13 assume true; 139#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 136#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 135#L17 assume !(main_~i~0#1 == main_~range~0#1); 134#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 132#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 133#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 118#L13 [2024-11-17 08:03:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times [2024-11-17 08:03:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506376317] [2024-11-17 08:03:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1713231993, now seen corresponding path program 1 times [2024-11-17 08:03:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994593716] [2024-11-17 08:03:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:57,377 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-17 08:03:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994593716] [2024-11-17 08:03:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994593716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:03:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963383652] [2024-11-17 08:03:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:57,379 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:03:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:03:57,379 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:57,405 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2024-11-17 08:03:57,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 64 transitions. [2024-11-17 08:03:57,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2024-11-17 08:03:57,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 64 transitions. [2024-11-17 08:03:57,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:03:57,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-17 08:03:57,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 64 transitions. [2024-11-17 08:03:57,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:03:57,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-11-17 08:03:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 64 transitions. [2024-11-17 08:03:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-11-17 08:03:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 36 states have internal predecessors, (54), 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-17 08:03:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-11-17 08:03:57,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-11-17 08:03:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:03:57,422 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-11-17 08:03:57,423 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:03:57,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 54 transitions. [2024-11-17 08:03:57,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-17 08:03:57,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:57,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:57,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:57,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:57,426 INFO L745 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 212#ULTIMATE.init_returnLabel#1 assume 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; 213#L13 [2024-11-17 08:03:57,426 INFO L747 eck$LassoCheckResult]: Loop: 213#L13 assume true; 233#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 230#L14 assume !(0 == main_~i~0#1); 231#L17 assume !(main_~i~0#1 == main_~range~0#1); 237#L20 assume !(1 == main_~up~0#1); 236#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 235#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 213#L13 [2024-11-17 08:03:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times [2024-11-17 08:03:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747810640] [2024-11-17 08:03:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:57,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1712307511, now seen corresponding path program 1 times [2024-11-17 08:03:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906808519] [2024-11-17 08:03:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2031898602, now seen corresponding path program 1 times [2024-11-17 08:03:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:57,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76665760] [2024-11-17 08:03:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:57,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:57,584 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:57,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:57,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:57,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:57,585 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:03:57,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:57,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:57,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-11-17 08:03:57,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:57,586 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:57,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:57,744 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:03:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:57,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:57,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:03:57,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:57,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:57,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:57,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:57,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:57,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:03:57,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:03:57,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:57,834 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:03:57,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:57,839 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:57,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:57,839 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:57,839 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:57,839 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:03:57,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:57,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:57,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2024-11-17 08:03:57,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:57,840 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:57,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:57,958 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:57,963 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:03:57,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:57,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:57,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:03:57,971 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-17 08:03:57,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:57,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:57,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:57,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:57,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:57,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:57,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:57,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:03:57,996 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:03:57,996 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:03:57,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,018 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-17 08:03:58,019 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-17 08:03:58,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:03:58,020 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:03:58,021 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:03:58,021 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-17 08:03:58,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:03:58,035 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:03:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:58,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:03:58,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:58,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:03:58,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:58,164 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-17 08:03:58,167 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-17 08:03:58,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 54 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:58,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 54 transitions. cyclomatic complexity: 18. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 170 transitions. Complement of second has 7 states. [2024-11-17 08:03:58,234 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-17 08:03:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-17 08:03:58,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-17 08:03:58,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:58,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-17 08:03:58,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:58,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-17 08:03:58,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:58,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 170 transitions. [2024-11-17 08:03:58,242 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 70 [2024-11-17 08:03:58,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 170 transitions. [2024-11-17 08:03:58,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-11-17 08:03:58,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2024-11-17 08:03:58,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 170 transitions. [2024-11-17 08:03:58,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:58,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-11-17 08:03:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 170 transitions. [2024-11-17 08:03:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-17 08:03:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 102 states have internal predecessors, (152), 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-17 08:03:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-11-17 08:03:58,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-11-17 08:03:58,256 INFO L425 stractBuchiCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-11-17 08:03:58,256 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:03:58,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 152 transitions. [2024-11-17 08:03:58,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2024-11-17 08:03:58,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:58,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:58,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:03:58,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:58,264 INFO L745 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 421#ULTIMATE.init_returnLabel#1 assume 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; 424#L13 assume true; 437#L13-1 [2024-11-17 08:03:58,265 INFO L747 eck$LassoCheckResult]: Loop: 437#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 471#L14 assume !(0 == main_~i~0#1); 473#L17 assume !(main_~i~0#1 == main_~range~0#1); 513#L20 assume !(1 == main_~up~0#1); 512#L23 assume !(0 == main_~up~0#1); 511#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 510#L13 assume true; 437#L13-1 [2024-11-17 08:03:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 47631, now seen corresponding path program 1 times [2024-11-17 08:03:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839766350] [2024-11-17 08:03:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:58,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1635989236, now seen corresponding path program 1 times [2024-11-17 08:03:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28416899] [2024-11-17 08:03:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1435651802, now seen corresponding path program 1 times [2024-11-17 08:03:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123687344] [2024-11-17 08:03:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123687344] [2024-11-17 08:03:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123687344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:58,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:03:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335670190] [2024-11-17 08:03:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:58,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:03:58,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:03:58,387 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. cyclomatic complexity: 54 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-17 08:03:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:58,406 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2024-11-17 08:03:58,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 124 transitions. [2024-11-17 08:03:58,408 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2024-11-17 08:03:58,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 83 states and 114 transitions. [2024-11-17 08:03:58,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-17 08:03:58,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-17 08:03:58,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 114 transitions. [2024-11-17 08:03:58,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:58,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 114 transitions. [2024-11-17 08:03:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 114 transitions. [2024-11-17 08:03:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-11-17 08:03:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 76 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-17 08:03:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-11-17 08:03:58,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-11-17 08:03:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:03:58,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-11-17 08:03:58,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:03:58,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 106 transitions. [2024-11-17 08:03:58,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2024-11-17 08:03:58,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:58,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:58,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:03:58,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:58,429 INFO L745 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 621#ULTIMATE.init_returnLabel#1 assume 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; 625#L13 assume true; 611#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 612#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 682#L17 [2024-11-17 08:03:58,429 INFO L747 eck$LassoCheckResult]: Loop: 682#L17 assume !(main_~i~0#1 == main_~range~0#1); 678#L20 assume !(1 == main_~up~0#1); 679#L23 assume !(0 == main_~up~0#1); 687#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 686#L13 assume true; 685#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 683#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 682#L17 [2024-11-17 08:03:58,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 45773836, now seen corresponding path program 1 times [2024-11-17 08:03:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103677233] [2024-11-17 08:03:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2032346385, now seen corresponding path program 1 times [2024-11-17 08:03:58,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953583848] [2024-11-17 08:03:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:58,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:58,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1575277700, now seen corresponding path program 1 times [2024-11-17 08:03:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172039046] [2024-11-17 08:03:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172039046] [2024-11-17 08:03:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172039046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:58,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:58,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:03:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614351400] [2024-11-17 08:03:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:58,603 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:58,603 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:58,603 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:58,603 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:58,603 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:03:58,603 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:58,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:58,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2024-11-17 08:03:58,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:58,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:58,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:58,615 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-17 08:03:58,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:58,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:58,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:58,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:58,777 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:58,777 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:03:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,780 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-17 08:03:58,782 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-17 08:03:58,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:58,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:58,806 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:03:58,807 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-17 08:03:58,822 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-17 08:03:58,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,827 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-17 08:03:58,829 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-17 08:03:58,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:58,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:58,854 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:03:58,854 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~range~0#1=1} Honda state: {ULTIMATE.start_main_~range~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:03:58,869 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-17 08:03:58,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,871 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-17 08:03:58,873 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-17 08:03:58,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:58,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:58,899 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:03:58,899 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-17 08:03:58,914 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-17 08:03:58,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,918 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-17 08:03:58,920 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-17 08:03:58,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:58,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:58,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:03:58,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:58,964 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-17 08:03:58,965 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-17 08:03:58,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:03:58,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:59,004 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:03:59,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,009 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:59,009 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:59,009 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:59,009 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:59,009 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:03:59,009 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,009 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:59,009 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:59,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2024-11-17 08:03:59,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:59,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:59,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:59,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:59,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:59,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:59,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:59,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:59,155 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:03:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,157 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-17 08:03:59,161 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-17 08:03:59,163 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-17 08:03:59,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:59,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:59,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:59,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,198 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-17 08:03:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,202 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-17 08:03:59,203 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-17 08:03:59,205 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-17 08:03:59,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,217 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:59,218 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:03:59,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,231 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-17 08:03:59,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:59,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:03:59,235 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-17 08:03:59,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,245 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:59,247 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:03:59,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,263 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:59,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:03:59,265 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-17 08:03:59,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:59,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:59,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:59,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:03:59,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,297 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-17 08:03:59,298 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-17 08:03:59,299 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-17 08:03:59,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:59,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:59,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,329 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-17 08:03:59,329 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-17 08:03:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,333 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-17 08:03:59,335 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-17 08:03:59,336 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-17 08:03:59,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,351 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,359 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2024-11-17 08:03:59,359 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2024-11-17 08:03:59,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:03:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,381 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-17 08:03:59,382 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-17 08:03:59,383 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-17 08:03:59,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,393 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,394 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:59,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,416 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-17 08:03:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,419 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-17 08:03:59,420 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-17 08:03:59,421 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-17 08:03:59,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,431 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,431 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:59,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,451 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-17 08:03:59,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,454 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-17 08:03:59,455 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-17 08:03:59,456 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-17 08:03:59,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,469 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,472 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2024-11-17 08:03:59,472 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2024-11-17 08:03:59,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,492 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-17 08:03:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,495 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-17 08:03:59,497 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-17 08:03:59,498 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-17 08:03:59,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,512 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,513 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-17 08:03:59,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,530 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-17 08:03:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,533 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-17 08:03:59,534 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-17 08:03:59,535 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-17 08:03:59,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,548 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:03:59,551 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:03:59,551 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:03:59,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:03:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,575 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-17 08:03:59,578 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-17 08:03:59,579 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-17 08:03:59,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,593 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,593 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:03:59,594 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:03:59,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,612 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-17 08:03:59,613 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-17 08:03:59,615 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-17 08:03:59,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,627 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,627 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:03:59,629 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:03:59,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,648 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:59,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:03:59,650 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-17 08:03:59,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,660 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:03:59,664 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:03:59,664 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:03:59,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,687 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-17 08:03:59,688 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-17 08:03:59,689 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-17 08:03:59,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,702 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:03:59,703 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:03:59,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,720 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-17 08:03:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,722 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-17 08:03:59,725 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-17 08:03:59,725 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-17 08:03:59,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,739 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:03:59,742 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2024-11-17 08:03:59,743 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2024-11-17 08:03:59,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,767 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-17 08:03:59,768 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-17 08:03:59,769 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-17 08:03:59,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,783 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,783 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:03:59,785 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2024-11-17 08:03:59,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,801 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-17 08:03:59,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,802 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-17 08:03:59,803 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-17 08:03:59,804 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-17 08:03:59,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,814 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,814 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:03:59,817 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2024-11-17 08:03:59,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-17 08:03:59,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,840 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-17 08:03:59,842 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-17 08:03:59,844 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-17 08:03:59,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,855 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:03:59,858 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2024-11-17 08:03:59,858 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2024-11-17 08:03:59,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,879 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-17 08:03:59,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,881 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-17 08:03:59,883 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-17 08:03:59,884 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-17 08:03:59,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:59,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,897 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:03:59,899 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-17 08:03:59,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,918 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-17 08:03:59,918 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-17 08:03:59,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,920 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-17 08:03:59,922 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-17 08:03:59,923 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-17 08:03:59,936 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:03:59,936 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:03:59,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:59,936 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,938 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2024-11-17 08:03:59,938 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2024-11-17 08:03:59,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:59,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,960 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-17 08:03:59,962 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-17 08:03:59,962 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-17 08:03:59,974 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:03:59,974 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:03:59,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:59,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:59,975 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:03:59,975 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:03:59,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:59,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:59,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:59,995 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-17 08:03:59,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:59,998 INFO L229 MonitoredProcess]: Starting monitored process 33 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-17 08:03:59,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:04:00,000 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-17 08:04:00,013 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,013 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,013 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,013 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:04:00,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:04:00,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,038 INFO L229 MonitoredProcess]: Starting monitored process 34 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-17 08:04:00,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:04:00,039 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-17 08:04:00,049 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,050 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,050 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:04:00,052 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2024-11-17 08:04:00,052 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2024-11-17 08:04:00,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-17 08:04:00,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,075 INFO L229 MonitoredProcess]: Starting monitored process 35 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-17 08:04:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:04:00,077 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-17 08:04:00,087 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,087 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,088 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-17 08:04:00,089 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-17 08:04:00,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-17 08:04:00,108 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-17 08:04:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,109 INFO L229 MonitoredProcess]: Starting monitored process 36 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-17 08:04:00,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:04:00,111 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-17 08:04:00,123 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,124 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-17 08:04:00,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,124 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,127 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,127 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:04:00,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-17 08:04:00,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,150 INFO L229 MonitoredProcess]: Starting monitored process 37 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-17 08:04:00,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:04:00,152 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-17 08:04:00,162 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,163 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-17 08:04:00,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,163 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,163 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,165 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:04:00,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:04:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,190 INFO L229 MonitoredProcess]: Starting monitored process 38 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-17 08:04:00,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:04:00,192 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-17 08:04:00,206 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,206 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-17 08:04:00,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,206 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,208 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,210 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:04:00,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,238 INFO L229 MonitoredProcess]: Starting monitored process 39 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-17 08:04:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:04:00,240 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-17 08:04:00,253 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,253 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-17 08:04:00,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,253 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,256 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,257 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:04:00,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,283 INFO L229 MonitoredProcess]: Starting monitored process 40 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-17 08:04:00,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:04:00,288 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-17 08:04:00,300 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,301 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-17 08:04:00,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,301 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,304 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:04:00,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:04:00,323 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-17 08:04:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,325 INFO L229 MonitoredProcess]: Starting monitored process 41 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-17 08:04:00,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-17 08:04:00,327 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-17 08:04:00,340 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,341 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,341 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:04:00,347 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2024-11-17 08:04:00,347 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2024-11-17 08:04:00,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-17 08:04:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,372 INFO L229 MonitoredProcess]: Starting monitored process 42 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-17 08:04:00,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-17 08:04:00,374 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-17 08:04:00,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,388 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,388 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,388 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:04:00,391 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2024-11-17 08:04:00,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-17 08:04:00,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,428 INFO L229 MonitoredProcess]: Starting monitored process 43 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-17 08:04:00,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-17 08:04:00,430 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-17 08:04:00,443 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,443 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,443 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,443 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:04:00,447 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2024-11-17 08:04:00,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-17 08:04:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,514 INFO L229 MonitoredProcess]: Starting monitored process 44 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-17 08:04:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-17 08:04:00,524 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-17 08:04:00,549 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,549 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,550 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:04:00,554 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2024-11-17 08:04:00,554 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2024-11-17 08:04:00,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,581 INFO L229 MonitoredProcess]: Starting monitored process 45 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-17 08:04:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:04:00,583 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-17 08:04:00,597 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,598 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,598 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-17 08:04:00,600 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-17 08:04:00,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,618 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-17 08:04:00,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,621 INFO L229 MonitoredProcess]: Starting monitored process 46 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-17 08:04:00,623 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-17 08:04:00,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-17 08:04:00,638 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,638 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,639 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,641 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,641 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:04:00,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-17 08:04:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,658 INFO L229 MonitoredProcess]: Starting monitored process 47 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-17 08:04:00,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-17 08:04:00,660 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-17 08:04:00,670 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,670 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,670 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,670 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,671 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:04:00,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-17 08:04:00,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,686 INFO L229 MonitoredProcess]: Starting monitored process 48 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-17 08:04:00,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-17 08:04:00,687 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-17 08:04:00,697 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,697 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,698 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,698 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,699 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:04:00,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,721 INFO L229 MonitoredProcess]: Starting monitored process 49 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-17 08:04:00,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-17 08:04:00,723 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-17 08:04:00,734 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,734 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,734 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,736 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,736 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:04:00,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-17 08:04:00,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,754 INFO L229 MonitoredProcess]: Starting monitored process 50 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-17 08:04:00,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-17 08:04:00,756 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-17 08:04:00,766 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,766 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-17 08:04:00,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,766 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-17 08:04:00,767 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:04:00,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-17 08:04:00,784 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-17 08:04:00,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,786 INFO L229 MonitoredProcess]: Starting monitored process 51 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-17 08:04:00,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-17 08:04:00,788 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-17 08:04:00,798 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,799 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,799 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-17 08:04:00,803 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2024-11-17 08:04:00,803 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-11-17 08:04:00,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,830 INFO L229 MonitoredProcess]: Starting monitored process 52 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-17 08:04:00,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-17 08:04:00,832 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-17 08:04:00,845 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,845 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,845 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,845 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-17 08:04:00,848 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-17 08:04:00,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,871 INFO L229 MonitoredProcess]: Starting monitored process 53 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-17 08:04:00,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-17 08:04:00,874 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-17 08:04:00,887 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,887 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,887 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:00,887 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-17 08:04:00,890 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:04:00,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:00,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,917 INFO L229 MonitoredProcess]: Starting monitored process 54 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-17 08:04:00,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-17 08:04:00,919 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-17 08:04:00,931 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,932 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,932 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-17 08:04:00,935 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2024-11-17 08:04:00,935 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-11-17 08:04:00,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-17 08:04:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:00,959 INFO L229 MonitoredProcess]: Starting monitored process 55 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-17 08:04:00,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-17 08:04:00,961 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-17 08:04:00,974 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-17 08:04:00,974 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-17 08:04:00,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:00,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:00,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:00,974 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-17 08:04:00,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:04:00,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:00,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:00,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-17 08:04:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:04:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:04:00,996 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 08:04:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:01,010 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-11-17 08:04:01,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 74 transitions. [2024-11-17 08:04:01,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:04:01,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 72 transitions. [2024-11-17 08:04:01,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-17 08:04:01,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-17 08:04:01,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2024-11-17 08:04:01,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:01,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-11-17 08:04:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2024-11-17 08:04:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-17 08:04:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 48 states have internal predecessors, (65), 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-17 08:04:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-11-17 08:04:01,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-17 08:04:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:04:01,021 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-17 08:04:01,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:04:01,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2024-11-17 08:04:01,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:04:01,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:01,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:01,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:04:01,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:01,023 INFO L745 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 762#ULTIMATE.init_returnLabel#1 assume 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; 765#L13 assume true; 779#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 787#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 757#L17 assume !(main_~i~0#1 == main_~range~0#1); 758#L20 [2024-11-17 08:04:01,023 INFO L747 eck$LassoCheckResult]: Loop: 758#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 766#L23 assume !(0 == main_~up~0#1); 767#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 792#L13 assume true; 800#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 773#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 774#L17 assume !(main_~i~0#1 == main_~range~0#1); 758#L20 [2024-11-17 08:04:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988926, now seen corresponding path program 1 times [2024-11-17 08:04:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076015199] [2024-11-17 08:04:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:01,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash -458668830, now seen corresponding path program 1 times [2024-11-17 08:04:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781862199] [2024-11-17 08:04:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 701464773, now seen corresponding path program 1 times [2024-11-17 08:04:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953580173] [2024-11-17 08:04:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953580173] [2024-11-17 08:04:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953580173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:04:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:04:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:04:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678507859] [2024-11-17 08:04:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:04:01,120 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:01,120 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:01,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:01,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:01,121 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:04:01,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:01,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:01,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-11-17 08:04:01,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:01,121 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:01,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,202 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:01,203 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:04:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,207 INFO L229 MonitoredProcess]: Starting monitored process 56 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-17 08:04:01,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-17 08:04:01,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:01,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:01,231 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:04:01,232 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-17 08:04:01,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:01,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,244 INFO L229 MonitoredProcess]: Starting monitored process 57 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-17 08:04:01,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-17 08:04:01,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:01,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:01,256 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:04:01,256 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-17 08:04:01,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-17 08:04:01,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,268 INFO L229 MonitoredProcess]: Starting monitored process 58 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-17 08:04:01,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-17 08:04:01,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:01,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:01,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-17 08:04:01,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,292 INFO L229 MonitoredProcess]: Starting monitored process 59 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-17 08:04:01,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-17 08:04:01,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:04:01,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:01,318 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:04:01,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-17 08:04:01,323 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:01,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:01,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:01,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:01,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:04:01,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:01,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:01,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2024-11-17 08:04:01,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:01,323 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:01,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:01,411 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:04:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,413 INFO L229 MonitoredProcess]: Starting monitored process 60 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-17 08:04:01,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-17 08:04:01,415 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-17 08:04:01,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:01,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:01,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:01,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:01,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:01,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:04:01,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:01,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:01,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-17 08:04:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,438 INFO L229 MonitoredProcess]: Starting monitored process 61 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-17 08:04:01,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-17 08:04:01,439 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-17 08:04:01,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:01,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:01,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:01,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:01,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:04:01,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:04:01,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:01,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-17 08:04:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,464 INFO L229 MonitoredProcess]: Starting monitored process 62 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-17 08:04:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-17 08:04:01,465 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-17 08:04:01,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:01,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:01,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:01,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:01,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:01,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:04:01,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:01,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:04:01,481 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:04:01,481 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:04:01,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,482 INFO L229 MonitoredProcess]: Starting monitored process 63 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-17 08:04:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-17 08:04:01,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:04:01,483 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:04:01,483 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:04:01,483 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-17 08:04:01,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-17 08:04:01,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:04:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:01,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:04:01,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:01,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:04:01,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:01,559 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-17 08:04:01,559 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-17 08:04:01,560 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 65 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:01,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 65 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 170 transitions. Complement of second has 7 states. [2024-11-17 08:04:01,605 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-17 08:04:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2024-11-17 08:04:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 6 letters. Loop has 7 letters. [2024-11-17 08:04:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 13 letters. Loop has 7 letters. [2024-11-17 08:04:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 6 letters. Loop has 14 letters. [2024-11-17 08:04:01,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:01,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 170 transitions. [2024-11-17 08:04:01,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2024-11-17 08:04:01,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 125 states and 161 transitions. [2024-11-17 08:04:01,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2024-11-17 08:04:01,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-17 08:04:01,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 161 transitions. [2024-11-17 08:04:01,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:01,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 161 transitions. [2024-11-17 08:04:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 161 transitions. [2024-11-17 08:04:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2024-11-17 08:04:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 109 states have internal predecessors, (145), 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-17 08:04:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2024-11-17 08:04:01,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 145 transitions. [2024-11-17 08:04:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:04:01,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:04:01,621 INFO L87 Difference]: Start difference. First operand 110 states and 145 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:01,646 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2024-11-17 08:04:01,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 164 transitions. [2024-11-17 08:04:01,647 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2024-11-17 08:04:01,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 111 states and 137 transitions. [2024-11-17 08:04:01,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2024-11-17 08:04:01,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-17 08:04:01,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 137 transitions. [2024-11-17 08:04:01,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:01,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-11-17 08:04:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 137 transitions. [2024-11-17 08:04:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 49. [2024-11-17 08:04:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 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-17 08:04:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-17 08:04:01,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-17 08:04:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:04:01,653 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-17 08:04:01,653 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:04:01,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2024-11-17 08:04:01,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:04:01,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:01,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:01,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:04:01,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:01,654 INFO L745 eck$LassoCheckResult]: Stem: 1249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1250#ULTIMATE.init_returnLabel#1 assume 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; 1254#L13 assume true; 1266#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1281#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1282#L17 assume !(main_~i~0#1 == main_~range~0#1); 1284#L20 [2024-11-17 08:04:01,654 INFO L747 eck$LassoCheckResult]: Loop: 1284#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1255#L23 assume !(0 == main_~up~0#1); 1256#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1251#L13 assume true; 1252#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1288#L14 assume !(0 == main_~i~0#1); 1285#L17 assume !(main_~i~0#1 == main_~range~0#1); 1284#L20 [2024-11-17 08:04:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988926, now seen corresponding path program 2 times [2024-11-17 08:04:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333712131] [2024-11-17 08:04:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,661 INFO L85 PathProgramCache]: Analyzing trace with hash -458668799, now seen corresponding path program 1 times [2024-11-17 08:04:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276376777] [2024-11-17 08:04:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:01,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 701464804, now seen corresponding path program 1 times [2024-11-17 08:04:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11731423] [2024-11-17 08:04:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:01,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:01,747 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:01,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:01,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:01,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:01,747 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:04:01,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:01,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:01,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-11-17 08:04:01,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:01,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:01,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:01,845 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:01,846 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:04:01,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,847 INFO L229 MonitoredProcess]: Starting monitored process 64 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-17 08:04:01,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-17 08:04:01,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:01,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:01,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-17 08:04:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:01,874 INFO L229 MonitoredProcess]: Starting monitored process 65 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-17 08:04:01,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-17 08:04:01,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:04:01,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:02,040 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:04:02,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-17 08:04:02,045 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:02,045 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:02,045 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:02,045 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:02,045 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:04:02,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:02,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:02,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2024-11-17 08:04:02,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:02,045 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:02,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:02,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:02,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:04:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,171 INFO L229 MonitoredProcess]: Starting monitored process 66 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-17 08:04:02,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-17 08:04:02,173 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-17 08:04:02,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:02,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:02,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:02,183 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:02,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:02,185 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:04:02,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:02,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:04:02,193 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:04:02,193 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:04:02,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,195 INFO L229 MonitoredProcess]: Starting monitored process 67 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-17 08:04:02,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-17 08:04:02,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:04:02,197 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:04:02,197 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:04:02,197 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-17 08:04:02,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:02,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:04:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:02,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:04:02,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:02,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:04:02,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:02,274 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-17 08:04:02,274 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-17 08:04:02,274 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:02,303 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 7 states. [2024-11-17 08:04:02,304 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-17 08:04:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2024-11-17 08:04:02,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 6 letters. Loop has 7 letters. [2024-11-17 08:04:02,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:02,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 13 letters. Loop has 7 letters. [2024-11-17 08:04:02,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:02,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 6 letters. Loop has 14 letters. [2024-11-17 08:04:02,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:02,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 132 transitions. [2024-11-17 08:04:02,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:04:02,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 92 states and 113 transitions. [2024-11-17 08:04:02,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-17 08:04:02,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-17 08:04:02,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 113 transitions. [2024-11-17 08:04:02,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:02,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 113 transitions. [2024-11-17 08:04:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 113 transitions. [2024-11-17 08:04:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-11-17 08:04:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.244186046511628) internal successors, (107), 85 states have internal predecessors, (107), 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-17 08:04:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-11-17 08:04:02,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-11-17 08:04:02,320 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-11-17 08:04:02,321 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:04:02,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 107 transitions. [2024-11-17 08:04:02,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:04:02,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:02,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:02,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:02,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:02,323 INFO L745 eck$LassoCheckResult]: Stem: 1471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1472#ULTIMATE.init_returnLabel#1 assume 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; 1473#L13 assume true; 1521#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1519#L14 assume !(0 == main_~i~0#1); 1517#L17 assume !(main_~i~0#1 == main_~range~0#1); 1513#L20 assume !(1 == main_~up~0#1); 1509#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1505#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 1507#L13 assume true; 1535#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1534#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1533#L17 assume !(main_~i~0#1 == main_~range~0#1); 1485#L20 [2024-11-17 08:04:02,323 INFO L747 eck$LassoCheckResult]: Loop: 1485#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1486#L23 assume !(0 == main_~up~0#1); 1478#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1468#L13 assume true; 1469#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1529#L14 assume !(0 == main_~i~0#1); 1494#L17 assume !(main_~i~0#1 == main_~range~0#1); 1485#L20 [2024-11-17 08:04:02,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash -248038681, now seen corresponding path program 1 times [2024-11-17 08:04:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229475126] [2024-11-17 08:04:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229475126] [2024-11-17 08:04:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229475126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:04:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996376212] [2024-11-17 08:04:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:02,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:04:02,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,374 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:04:02,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-11-17 08:04:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:02,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:04:02,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:02,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:04:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996376212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:04:02,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:04:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-17 08:04:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855001263] [2024-11-17 08:04:02,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:04:02,455 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:04:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash -458668799, now seen corresponding path program 2 times [2024-11-17 08:04:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906626930] [2024-11-17 08:04:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:02,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:02,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:02,516 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:02,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:02,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:02,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:02,516 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:04:02,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:02,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:02,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2024-11-17 08:04:02,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:02,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:02,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,633 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:02,633 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:04:02,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,635 INFO L229 MonitoredProcess]: Starting monitored process 69 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-17 08:04:02,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-17 08:04:02,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:02,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:02,654 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:04:02,654 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:04:02,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-17 08:04:02,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,666 INFO L229 MonitoredProcess]: Starting monitored process 70 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-17 08:04:02,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-17 08:04:02,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:02,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:02,685 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:04:02,685 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:04:02,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-17 08:04:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,696 INFO L229 MonitoredProcess]: Starting monitored process 71 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-17 08:04:02,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-17 08:04:02,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:04:02,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:02,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-17 08:04:02,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,720 INFO L229 MonitoredProcess]: Starting monitored process 72 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-17 08:04:02,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-17 08:04:02,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:04:02,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:04:02,874 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:04:02,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-17 08:04:02,879 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:04:02,879 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:04:02,879 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:04:02,879 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:04:02,879 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:04:02,879 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,879 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:04:02,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:04:02,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2024-11-17 08:04:02,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:04:02,880 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:04:02,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:04:02,984 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:04:02,985 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:04:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:02,986 INFO L229 MonitoredProcess]: Starting monitored process 73 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-17 08:04:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-17 08:04:02,987 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-17 08:04:02,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:02,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:02,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:02,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:02,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:04:02,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:04:03,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:03,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-17 08:04:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:03,013 INFO L229 MonitoredProcess]: Starting monitored process 74 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-17 08:04:03,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-17 08:04:03,014 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-17 08:04:03,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:03,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:03,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:04:03,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:03,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:04:03,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:04:03,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:04:03,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-17 08:04:03,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:03,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:03,041 INFO L229 MonitoredProcess]: Starting monitored process 75 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-17 08:04:03,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-17 08:04:03,042 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-17 08:04:03,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:04:03,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:04:03,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:04:03,053 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:04:03,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:04:03,054 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:04:03,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:04:03,058 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:04:03,063 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:04:03,063 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-17 08:04:03,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:04:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:03,065 INFO L229 MonitoredProcess]: Starting monitored process 76 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-17 08:04:03,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-17 08:04:03,067 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:04:03,067 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:04:03,067 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:04:03,067 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-17 08:04:03,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:03,083 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:04:03,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,174 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-17 08:04:03,174 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-17 08:04:03,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,209 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) Result 114 states and 140 transitions. Complement of second has 7 states. [2024-11-17 08:04:03,209 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-17 08:04:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2024-11-17 08:04:03,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 13 letters. Loop has 7 letters. [2024-11-17 08:04:03,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:03,211 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:04:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,289 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-17 08:04:03,289 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-17 08:04:03,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) Result 147 states and 180 transitions. Complement of second has 9 states. [2024-11-17 08:04:03,333 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-17 08:04:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2024-11-17 08:04:03,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 13 letters. Loop has 7 letters. [2024-11-17 08:04:03,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:03,334 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:04:03,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,414 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-17 08:04:03,414 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-17 08:04:03,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 107 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) Result 135 states and 169 transitions. Complement of second has 8 states. [2024-11-17 08:04:03,445 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-17 08:04:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-17 08:04:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-17 08:04:03,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 7 letters. [2024-11-17 08:04:03,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:03,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 20 letters. Loop has 7 letters. [2024-11-17 08:04:03,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:03,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 14 letters. [2024-11-17 08:04:03,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:04:03,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 169 transitions. [2024-11-17 08:04:03,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-17 08:04:03,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 101 states and 125 transitions. [2024-11-17 08:04:03,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-17 08:04:03,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-11-17 08:04:03,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 125 transitions. [2024-11-17 08:04:03,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:03,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-11-17 08:04:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 125 transitions. [2024-11-17 08:04:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 59. [2024-11-17 08:04:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 58 states have internal predecessors, (76), 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-17 08:04:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-11-17 08:04:03,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-11-17 08:04:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:04:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:04:03,455 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:04:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:03,537 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2024-11-17 08:04:03,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 305 transitions. [2024-11-17 08:04:03,539 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 95 [2024-11-17 08:04:03,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 234 states and 289 transitions. [2024-11-17 08:04:03,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2024-11-17 08:04:03,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-11-17 08:04:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 289 transitions. [2024-11-17 08:04:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:03,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 234 states and 289 transitions. [2024-11-17 08:04:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 289 transitions. [2024-11-17 08:04:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-11-17 08:04:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.239795918367347) internal successors, (243), 195 states have internal predecessors, (243), 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-17 08:04:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2024-11-17 08:04:03,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 243 transitions. [2024-11-17 08:04:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:04:03,555 INFO L425 stractBuchiCegarLoop]: Abstraction has 196 states and 243 transitions. [2024-11-17 08:04:03,555 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:04:03,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 243 transitions. [2024-11-17 08:04:03,557 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2024-11-17 08:04:03,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:03,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:03,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:04:03,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-17 08:04:03,558 INFO L745 eck$LassoCheckResult]: Stem: 2566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2567#ULTIMATE.init_returnLabel#1 assume 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; 2570#L13 assume true; 2661#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2659#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2656#L17 assume !(main_~i~0#1 == main_~range~0#1); 2650#L20 [2024-11-17 08:04:03,558 INFO L747 eck$LassoCheckResult]: Loop: 2650#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2647#L23 assume !(0 == main_~up~0#1); 2644#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2645#L13 assume true; 2660#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2658#L14 assume !(0 == main_~i~0#1); 2628#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2627#L20 assume !(1 == main_~up~0#1); 2622#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2623#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2634#L13 assume true; 2633#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2631#L14 assume !(0 == main_~i~0#1); 2626#L17 assume !(main_~i~0#1 == main_~range~0#1); 2624#L20 assume !(1 == main_~up~0#1); 2621#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2619#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2620#L13 assume true; 2632#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2629#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2630#L17 assume !(main_~i~0#1 == main_~range~0#1); 2650#L20 [2024-11-17 08:04:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988926, now seen corresponding path program 3 times [2024-11-17 08:04:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426350390] [2024-11-17 08:04:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:03,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:03,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -902455199, now seen corresponding path program 1 times [2024-11-17 08:04:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717531650] [2024-11-17 08:04:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717531650] [2024-11-17 08:04:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717531650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:04:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198364883] [2024-11-17 08:04:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:04:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:03,707 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:04:03,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-17 08:04:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:03,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:04:03,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:03,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-17 08:04:03,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-17 08:04:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:03,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:04:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198364883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:04:03,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:04:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2024-11-17 08:04:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754816027] [2024-11-17 08:04:03,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:04:03,827 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:04:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:04:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:04:03,827 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. cyclomatic complexity: 54 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-17 08:04:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:03,985 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2024-11-17 08:04:03,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 133 transitions. [2024-11-17 08:04:03,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:03,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 118 states and 127 transitions. [2024-11-17 08:04:03,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-17 08:04:03,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-17 08:04:03,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 127 transitions. [2024-11-17 08:04:03,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:03,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-11-17 08:04:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 127 transitions. [2024-11-17 08:04:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-11-17 08:04:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.087378640776699) internal successors, (112), 102 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-17 08:04:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-17 08:04:03,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-17 08:04:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:04:03,995 INFO L425 stractBuchiCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-17 08:04:03,996 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:04:03,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 112 transitions. [2024-11-17 08:04:03,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:03,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:03,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:03,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1] [2024-11-17 08:04:03,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:03,999 INFO L745 eck$LassoCheckResult]: Stem: 3029#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3030#ULTIMATE.init_returnLabel#1 assume 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; 3034#L13 assume true; 3047#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3044#L14 assume !(0 == main_~i~0#1); 3046#L17 assume !(main_~i~0#1 == main_~range~0#1); 3054#L20 assume !(1 == main_~up~0#1); 3053#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3050#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3051#L13 assume true; 3109#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3111#L14 assume !(0 == main_~i~0#1); 3110#L17 assume !(main_~i~0#1 == main_~range~0#1); 3058#L20 assume !(1 == main_~up~0#1); 3059#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3060#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3032#L13 assume true; 3033#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3095#L14 assume !(0 == main_~i~0#1); 3092#L17 assume !(main_~i~0#1 == main_~range~0#1); 3089#L20 assume !(1 == main_~up~0#1); 3086#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3082#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3083#L13 assume true; 3079#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3075#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3073#L17 [2024-11-17 08:04:03,999 INFO L747 eck$LassoCheckResult]: Loop: 3073#L17 assume !(main_~i~0#1 == main_~range~0#1); 3074#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3105#L23 assume !(0 == main_~up~0#1); 3104#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3102#L13 assume true; 3100#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3098#L14 assume !(0 == main_~i~0#1); 3094#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3091#L20 assume !(1 == main_~up~0#1); 3088#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3085#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3080#L13 assume true; 3081#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3096#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3073#L17 [2024-11-17 08:04:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 731436387, now seen corresponding path program 2 times [2024-11-17 08:04:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:04,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965731973] [2024-11-17 08:04:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965731973] [2024-11-17 08:04:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965731973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:04:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600493542] [2024-11-17 08:04:04,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:04:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:04:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:04,067 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:04:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-17 08:04:04,099 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:04:04,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:04:04,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:04:04,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:04:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600493542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:04:04,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:04:04,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-17 08:04:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278429561] [2024-11-17 08:04:04,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:04:04,208 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:04:04,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1752714205, now seen corresponding path program 2 times [2024-11-17 08:04:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310345884] [2024-11-17 08:04:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:04,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:04,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:04:04,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:04:04,268 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. cyclomatic complexity: 13 Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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-17 08:04:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:04,428 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2024-11-17 08:04:04,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 196 transitions. [2024-11-17 08:04:04,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:04,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 175 states and 184 transitions. [2024-11-17 08:04:04,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2024-11-17 08:04:04,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2024-11-17 08:04:04,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 184 transitions. [2024-11-17 08:04:04,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:04,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 184 transitions. [2024-11-17 08:04:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 184 transitions. [2024-11-17 08:04:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2024-11-17 08:04:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.0566037735849056) internal successors, (168), 158 states have internal predecessors, (168), 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-17 08:04:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2024-11-17 08:04:04,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 159 states and 168 transitions. [2024-11-17 08:04:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 08:04:04,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 159 states and 168 transitions. [2024-11-17 08:04:04,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:04:04,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 168 transitions. [2024-11-17 08:04:04,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:04,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:04,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:04,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1] [2024-11-17 08:04:04,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:04,439 INFO L745 eck$LassoCheckResult]: Stem: 3504#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3505#ULTIMATE.init_returnLabel#1 assume 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; 3506#L13 assume true; 3519#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3531#L14 assume !(0 == main_~i~0#1); 3529#L17 assume !(main_~i~0#1 == main_~range~0#1); 3528#L20 assume !(1 == main_~up~0#1); 3527#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3524#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3523#L13 assume true; 3499#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3500#L14 assume !(0 == main_~i~0#1); 3495#L17 assume !(main_~i~0#1 == main_~range~0#1); 3496#L20 assume !(1 == main_~up~0#1); 3515#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3643#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3642#L13 assume true; 3641#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3640#L14 assume !(0 == main_~i~0#1); 3639#L17 assume !(main_~i~0#1 == main_~range~0#1); 3638#L20 assume !(1 == main_~up~0#1); 3637#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3636#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3635#L13 assume true; 3634#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3633#L14 assume !(0 == main_~i~0#1); 3632#L17 assume !(main_~i~0#1 == main_~range~0#1); 3631#L20 assume !(1 == main_~up~0#1); 3630#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3629#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3628#L13 assume true; 3627#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3626#L14 assume !(0 == main_~i~0#1); 3625#L17 assume !(main_~i~0#1 == main_~range~0#1); 3624#L20 assume !(1 == main_~up~0#1); 3623#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3622#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3621#L13 assume true; 3620#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3619#L14 assume !(0 == main_~i~0#1); 3618#L17 assume !(main_~i~0#1 == main_~range~0#1); 3617#L20 assume !(1 == main_~up~0#1); 3616#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3615#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3559#L13 assume true; 3612#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3579#L14 assume !(0 == main_~i~0#1); 3577#L17 assume !(main_~i~0#1 == main_~range~0#1); 3575#L20 assume !(1 == main_~up~0#1); 3563#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3558#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3556#L13 assume true; 3557#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3550#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3551#L17 [2024-11-17 08:04:04,439 INFO L747 eck$LassoCheckResult]: Loop: 3551#L17 assume !(main_~i~0#1 == main_~range~0#1); 3513#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3514#L23 assume !(0 == main_~up~0#1); 3571#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3570#L13 assume true; 3569#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3568#L14 assume !(0 == main_~i~0#1); 3567#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3566#L20 assume !(1 == main_~up~0#1); 3565#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3562#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3561#L13 assume true; 3554#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3555#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3551#L17 [2024-11-17 08:04:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -969294557, now seen corresponding path program 3 times [2024-11-17 08:04:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234321390] [2024-11-17 08:04:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234321390] [2024-11-17 08:04:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234321390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:04:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866138174] [2024-11-17 08:04:04,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:04:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:04:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:04,573 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:04:04,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-17 08:04:04,614 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-17 08:04:04,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:04:04,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:04:04,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:04:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866138174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:04:04,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:04:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-17 08:04:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551121343] [2024-11-17 08:04:04,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:04:04,838 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:04:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1752714205, now seen corresponding path program 3 times [2024-11-17 08:04:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:04,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891355068] [2024-11-17 08:04:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:04,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:04,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:04,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 08:04:04,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2024-11-17 08:04:04,898 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. cyclomatic complexity: 13 Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 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-17 08:04:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:05,182 INFO L93 Difference]: Finished difference Result 311 states and 320 transitions. [2024-11-17 08:04:05,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 320 transitions. [2024-11-17 08:04:05,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:05,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 287 states and 296 transitions. [2024-11-17 08:04:05,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2024-11-17 08:04:05,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2024-11-17 08:04:05,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 296 transitions. [2024-11-17 08:04:05,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:05,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 287 states and 296 transitions. [2024-11-17 08:04:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 296 transitions. [2024-11-17 08:04:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 271. [2024-11-17 08:04:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 1.033210332103321) internal successors, (280), 270 states have internal predecessors, (280), 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-17 08:04:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 280 transitions. [2024-11-17 08:04:05,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 280 transitions. [2024-11-17 08:04:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 08:04:05,195 INFO L425 stractBuchiCegarLoop]: Abstraction has 271 states and 280 transitions. [2024-11-17 08:04:05,197 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:04:05,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 280 transitions. [2024-11-17 08:04:05,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:05,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:05,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:05,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1] [2024-11-17 08:04:05,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:05,202 INFO L745 eck$LassoCheckResult]: Stem: 4342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4343#ULTIMATE.init_returnLabel#1 assume 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; 4344#L13 assume true; 4357#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4365#L14 assume !(0 == main_~i~0#1); 4363#L17 assume !(main_~i~0#1 == main_~range~0#1); 4362#L20 assume !(1 == main_~up~0#1); 4361#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4358#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4341#L13 assume true; 4334#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4335#L14 assume !(0 == main_~i~0#1); 4590#L17 assume !(main_~i~0#1 == main_~range~0#1); 4354#L20 assume !(1 == main_~up~0#1); 4355#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4588#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4587#L13 assume true; 4586#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4585#L14 assume !(0 == main_~i~0#1); 4584#L17 assume !(main_~i~0#1 == main_~range~0#1); 4583#L20 assume !(1 == main_~up~0#1); 4582#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4581#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4580#L13 assume true; 4579#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4578#L14 assume !(0 == main_~i~0#1); 4577#L17 assume !(main_~i~0#1 == main_~range~0#1); 4576#L20 assume !(1 == main_~up~0#1); 4575#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4574#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4573#L13 assume true; 4572#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4571#L14 assume !(0 == main_~i~0#1); 4570#L17 assume !(main_~i~0#1 == main_~range~0#1); 4569#L20 assume !(1 == main_~up~0#1); 4568#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4567#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4566#L13 assume true; 4565#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4564#L14 assume !(0 == main_~i~0#1); 4563#L17 assume !(main_~i~0#1 == main_~range~0#1); 4562#L20 assume !(1 == main_~up~0#1); 4561#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4560#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4559#L13 assume true; 4558#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4557#L14 assume !(0 == main_~i~0#1); 4556#L17 assume !(main_~i~0#1 == main_~range~0#1); 4555#L20 assume !(1 == main_~up~0#1); 4554#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4553#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4552#L13 assume true; 4551#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4550#L14 assume !(0 == main_~i~0#1); 4549#L17 assume !(main_~i~0#1 == main_~range~0#1); 4548#L20 assume !(1 == main_~up~0#1); 4547#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4546#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4545#L13 assume true; 4544#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4543#L14 assume !(0 == main_~i~0#1); 4542#L17 assume !(main_~i~0#1 == main_~range~0#1); 4541#L20 assume !(1 == main_~up~0#1); 4540#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4539#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4538#L13 assume true; 4537#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4536#L14 assume !(0 == main_~i~0#1); 4535#L17 assume !(main_~i~0#1 == main_~range~0#1); 4534#L20 assume !(1 == main_~up~0#1); 4533#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4532#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4531#L13 assume true; 4530#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4529#L14 assume !(0 == main_~i~0#1); 4528#L17 assume !(main_~i~0#1 == main_~range~0#1); 4527#L20 assume !(1 == main_~up~0#1); 4526#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4525#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4524#L13 assume true; 4523#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4522#L14 assume !(0 == main_~i~0#1); 4521#L17 assume !(main_~i~0#1 == main_~range~0#1); 4520#L20 assume !(1 == main_~up~0#1); 4519#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4518#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4517#L13 assume true; 4516#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume !(0 == main_~i~0#1); 4514#L17 assume !(main_~i~0#1 == main_~range~0#1); 4513#L20 assume !(1 == main_~up~0#1); 4512#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4511#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4510#L13 assume true; 4509#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4508#L14 assume !(0 == main_~i~0#1); 4507#L17 assume !(main_~i~0#1 == main_~range~0#1); 4506#L20 assume !(1 == main_~up~0#1); 4505#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4504#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4394#L13 assume true; 4501#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4499#L14 assume !(0 == main_~i~0#1); 4409#L17 assume !(main_~i~0#1 == main_~range~0#1); 4407#L20 assume !(1 == main_~up~0#1); 4397#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4392#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4393#L13 assume true; 4411#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4385#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4386#L17 [2024-11-17 08:04:05,203 INFO L747 eck$LassoCheckResult]: Loop: 4386#L17 assume !(main_~i~0#1 == main_~range~0#1); 4352#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4353#L23 assume !(0 == main_~up~0#1); 4405#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4404#L13 assume true; 4403#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4402#L14 assume !(0 == main_~i~0#1); 4401#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4400#L20 assume !(1 == main_~up~0#1); 4399#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4396#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4391#L13 assume true; 4389#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4390#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4386#L17 [2024-11-17 08:04:05,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1102851235, now seen corresponding path program 4 times [2024-11-17 08:04:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456449301] [2024-11-17 08:04:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:04:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:04:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456449301] [2024-11-17 08:04:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456449301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:04:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745781360] [2024-11-17 08:04:05,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:04:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:04:05,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:04:05,587 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:04:05,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2024-11-17 08:04:05,639 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:04:05,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:04:05,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 08:04:05,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:04:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:05,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:04:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:04:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745781360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:04:06,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:04:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2024-11-17 08:04:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784462562] [2024-11-17 08:04:06,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:04:06,134 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:04:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1752714205, now seen corresponding path program 4 times [2024-11-17 08:04:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252061670] [2024-11-17 08:04:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:04:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 08:04:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2024-11-17 08:04:06,189 INFO L87 Difference]: Start difference. First operand 271 states and 280 transitions. cyclomatic complexity: 13 Second operand has 23 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 23 states have internal predecessors, (148), 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-17 08:04:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:04:06,397 INFO L93 Difference]: Finished difference Result 355 states and 364 transitions. [2024-11-17 08:04:06,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 364 transitions. [2024-11-17 08:04:06,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:06,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 343 states and 352 transitions. [2024-11-17 08:04:06,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-11-17 08:04:06,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-11-17 08:04:06,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 352 transitions. [2024-11-17 08:04:06,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:04:06,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 343 states and 352 transitions. [2024-11-17 08:04:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 352 transitions. [2024-11-17 08:04:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 327. [2024-11-17 08:04:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 327 states have (on average 1.0275229357798166) internal successors, (336), 326 states have internal predecessors, (336), 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-17 08:04:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 336 transitions. [2024-11-17 08:04:06,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 327 states and 336 transitions. [2024-11-17 08:04:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 08:04:06,407 INFO L425 stractBuchiCegarLoop]: Abstraction has 327 states and 336 transitions. [2024-11-17 08:04:06,407 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:04:06,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 336 transitions. [2024-11-17 08:04:06,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:04:06,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:04:06,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:04:06,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1] [2024-11-17 08:04:06,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:04:06,413 INFO L745 eck$LassoCheckResult]: Stem: 5668#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5669#ULTIMATE.init_returnLabel#1 assume 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; 5670#L13 assume true; 5686#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5695#L14 assume !(0 == main_~i~0#1); 5693#L17 assume !(main_~i~0#1 == main_~range~0#1); 5692#L20 assume !(1 == main_~up~0#1); 5691#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5688#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5666#L13 assume true; 5667#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5680#L14 assume !(0 == main_~i~0#1); 5681#L17 assume !(main_~i~0#1 == main_~range~0#1); 5973#L20 assume !(1 == main_~up~0#1); 5673#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5674#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5971#L13 assume true; 5970#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5969#L14 assume !(0 == main_~i~0#1); 5968#L17 assume !(main_~i~0#1 == main_~range~0#1); 5967#L20 assume !(1 == main_~up~0#1); 5966#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5965#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5964#L13 assume true; 5963#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5962#L14 assume !(0 == main_~i~0#1); 5961#L17 assume !(main_~i~0#1 == main_~range~0#1); 5960#L20 assume !(1 == main_~up~0#1); 5959#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5958#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5957#L13 assume true; 5956#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5955#L14 assume !(0 == main_~i~0#1); 5954#L17 assume !(main_~i~0#1 == main_~range~0#1); 5953#L20 assume !(1 == main_~up~0#1); 5952#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5951#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5950#L13 assume true; 5949#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5948#L14 assume !(0 == main_~i~0#1); 5947#L17 assume !(main_~i~0#1 == main_~range~0#1); 5946#L20 assume !(1 == main_~up~0#1); 5945#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5944#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5943#L13 assume true; 5942#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5941#L14 assume !(0 == main_~i~0#1); 5940#L17 assume !(main_~i~0#1 == main_~range~0#1); 5939#L20 assume !(1 == main_~up~0#1); 5938#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5937#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5936#L13 assume true; 5935#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5934#L14 assume !(0 == main_~i~0#1); 5933#L17 assume !(main_~i~0#1 == main_~range~0#1); 5932#L20 assume !(1 == main_~up~0#1); 5931#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5930#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5929#L13 assume true; 5928#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5927#L14 assume !(0 == main_~i~0#1); 5926#L17 assume !(main_~i~0#1 == main_~range~0#1); 5925#L20 assume !(1 == main_~up~0#1); 5924#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5923#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5922#L13 assume true; 5921#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5920#L14 assume !(0 == main_~i~0#1); 5919#L17 assume !(main_~i~0#1 == main_~range~0#1); 5918#L20 assume !(1 == main_~up~0#1); 5917#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5916#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5915#L13 assume true; 5914#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5913#L14 assume !(0 == main_~i~0#1); 5912#L17 assume !(main_~i~0#1 == main_~range~0#1); 5911#L20 assume !(1 == main_~up~0#1); 5910#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5909#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5908#L13 assume true; 5907#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5906#L14 assume !(0 == main_~i~0#1); 5905#L17 assume !(main_~i~0#1 == main_~range~0#1); 5904#L20 assume !(1 == main_~up~0#1); 5903#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5902#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5901#L13 assume true; 5900#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5899#L14 assume !(0 == main_~i~0#1); 5898#L17 assume !(main_~i~0#1 == main_~range~0#1); 5897#L20 assume !(1 == main_~up~0#1); 5896#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5895#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5894#L13 assume true; 5893#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5892#L14 assume !(0 == main_~i~0#1); 5891#L17 assume !(main_~i~0#1 == main_~range~0#1); 5890#L20 assume !(1 == main_~up~0#1); 5889#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5888#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5887#L13 assume true; 5886#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5885#L14 assume !(0 == main_~i~0#1); 5884#L17 assume !(main_~i~0#1 == main_~range~0#1); 5883#L20 assume !(1 == main_~up~0#1); 5882#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5881#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5880#L13 assume true; 5879#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5878#L14 assume !(0 == main_~i~0#1); 5877#L17 assume !(main_~i~0#1 == main_~range~0#1); 5876#L20 assume !(1 == main_~up~0#1); 5875#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5874#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5873#L13 assume true; 5872#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5871#L14 assume !(0 == main_~i~0#1); 5870#L17 assume !(main_~i~0#1 == main_~range~0#1); 5869#L20 assume !(1 == main_~up~0#1); 5868#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5867#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5866#L13 assume true; 5865#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5864#L14 assume !(0 == main_~i~0#1); 5863#L17 assume !(main_~i~0#1 == main_~range~0#1); 5862#L20 assume !(1 == main_~up~0#1); 5861#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5860#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5725#L13 assume true; 5857#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5740#L14 assume !(0 == main_~i~0#1); 5738#L17 assume !(main_~i~0#1 == main_~range~0#1); 5736#L20 assume !(1 == main_~up~0#1); 5728#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5724#L26 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5720#L13 assume true; 5721#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5714#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5715#L17 [2024-11-17 08:04:06,414 INFO L747 eck$LassoCheckResult]: Loop: 5715#L17 assume !(main_~i~0#1 == main_~range~0#1); 5682#L20 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5683#L23 assume !(0 == main_~up~0#1); 5735#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5734#L13 assume true; 5733#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5732#L14 assume !(0 == main_~i~0#1); 5731#L17 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5730#L20 assume !(1 == main_~up~0#1); 5729#L23 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5726#L26 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5723#L13 assume true; 5718#L13-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5719#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5715#L17 [2024-11-17 08:04:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1803701149, now seen corresponding path program 5 times [2024-11-17 08:04:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681068979] [2024-11-17 08:04:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:06,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1752714205, now seen corresponding path program 5 times [2024-11-17 08:04:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344398162] [2024-11-17 08:04:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:06,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:04:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1964397377, now seen corresponding path program 1 times [2024-11-17 08:04:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:04:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465586151] [2024-11-17 08:04:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:04:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:04:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:06,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:04:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:07,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:04:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:04:07,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:04:07 BoogieIcfgContainer [2024-11-17 08:04:07,494 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:04:07,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:04:07,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:04:07,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:04:07,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:56" (3/4) ... [2024-11-17 08:04:07,497 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:04:07,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:04:07,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:04:07,587 INFO L158 Benchmark]: Toolchain (without parser) took 11625.41ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 123.9MB in the beginning and 79.5MB in the end (delta: 44.5MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,588 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:04:07,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.35ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 112.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 174.1MB. Free memory was 112.1MB in the beginning and 110.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:04:07,588 INFO L158 Benchmark]: Boogie Preprocessor took 27.88ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 109.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,588 INFO L158 Benchmark]: IcfgBuilder took 285.89ms. Allocated memory is still 174.1MB. Free memory was 109.2MB in the beginning and 99.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,589 INFO L158 Benchmark]: BuchiAutomizer took 10919.06ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 99.5MB in the beginning and 85.8MB in the end (delta: 13.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,589 INFO L158 Benchmark]: Witness Printer took 92.25ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 79.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 08:04:07,590 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.18ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.35ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 112.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 174.1MB. Free memory was 112.1MB in the beginning and 110.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.88ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 109.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 285.89ms. Allocated memory is still 174.1MB. Free memory was 109.2MB in the beginning and 99.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10919.06ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 99.5MB in the beginning and 85.8MB in the end (delta: 13.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 92.25ms. Allocated memory is still 209.7MB. Free memory was 85.8MB in the beginning and 79.5MB in the end (delta: 6.3MB). 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 15 terminating modules (11 trivial, 3 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) 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. 11 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 327 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 14 iterations. TraceHistogramMax:20. Analysis of lassos took 8.4s. Construction of modules took 0.6s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 261 StatesRemovedByMinimization, 13 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 534 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 231 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT1 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax141 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf97 smp71 dnf146 smp85 tf107 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 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-17 08:04:07,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2024-11-17 08:04:07,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2024-11-17 08:04:08,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2024-11-17 08:04:08,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2024-11-17 08:04:08,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2024-11-17 08:04:08,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)