./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 574ddb4e Calling Ultimate with: /usr/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.graphml --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.2-?-574ddb4 [2023-02-19 00:16:51,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-19 00:16:51,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-19 00:16:51,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-19 00:16:51,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-19 00:16:51,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-19 00:16:51,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-19 00:16:51,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-19 00:16:51,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-19 00:16:51,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-19 00:16:51,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-19 00:16:51,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-19 00:16:51,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-19 00:16:51,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-19 00:16:51,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-19 00:16:51,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-19 00:16:51,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-19 00:16:51,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-19 00:16:51,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-19 00:16:51,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-19 00:16:51,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-19 00:16:51,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-19 00:16:51,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-19 00:16:51,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-19 00:16:51,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-19 00:16:51,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-19 00:16:51,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-19 00:16:51,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-19 00:16:51,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-19 00:16:51,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-19 00:16:51,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-19 00:16:51,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-19 00:16:51,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-19 00:16:51,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-19 00:16:51,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-19 00:16:51,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-19 00:16:51,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-19 00:16:51,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-19 00:16:51,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-19 00:16:51,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-19 00:16:51,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-19 00:16:51,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-19 00:16:51,970 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-19 00:16:51,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-19 00:16:51,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-19 00:16:51,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-19 00:16:51,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-19 00:16:51,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-19 00:16:51,976 INFO L138 SettingsManager]: * Use SBE=true [2023-02-19 00:16:51,976 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-19 00:16:51,976 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-19 00:16:51,976 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-19 00:16:51,977 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-19 00:16:51,977 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-19 00:16:51,977 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-19 00:16:51,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-19 00:16:51,977 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-19 00:16:51,978 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-19 00:16:51,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-19 00:16:51,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-19 00:16:51,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-19 00:16:51,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-19 00:16:51,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-19 00:16:51,980 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-19 00:16:51,980 INFO L138 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.graphml 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 [2023-02-19 00:16:52,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-19 00:16:52,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-19 00:16:52,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-19 00:16:52,225 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-19 00:16:52,226 INFO L275 PluginConnector]: CDTParser initialized [2023-02-19 00:16:52,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-19 00:16:53,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-19 00:16:53,275 INFO L351 CDTParser]: Found 1 translation units. [2023-02-19 00:16:53,275 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-19 00:16:53,279 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188c01d3b/a589cb44dba7412683a8e716f8a26c6e/FLAG23781f93a [2023-02-19 00:16:53,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188c01d3b/a589cb44dba7412683a8e716f8a26c6e [2023-02-19 00:16:53,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-19 00:16:53,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-19 00:16:53,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-19 00:16:53,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-19 00:16:53,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-19 00:16:53,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc8ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53, skipping insertion in model container [2023-02-19 00:16:53,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-19 00:16:53,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-19 00:16:53,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-19 00:16:53,418 INFO L203 MainTranslator]: Completed pre-run [2023-02-19 00:16:53,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-19 00:16:53,436 INFO L208 MainTranslator]: Completed translation [2023-02-19 00:16:53,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53 WrapperNode [2023-02-19 00:16:53,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-19 00:16:53,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-19 00:16:53,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-19 00:16:53,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-19 00:16:53,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,464 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-19 00:16:53,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-19 00:16:53,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-19 00:16:53,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-19 00:16:53,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-19 00:16:53,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-19 00:16:53,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-19 00:16:53,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-19 00:16:53,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-19 00:16:53,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (1/1) ... [2023-02-19 00:16:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:53,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:53,514 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) [2023-02-19 00:16:53,534 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 [2023-02-19 00:16:53,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-19 00:16:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-19 00:16:53,600 INFO L235 CfgBuilder]: Building ICFG [2023-02-19 00:16:53,602 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-19 00:16:53,689 INFO L276 CfgBuilder]: Performing block encoding [2023-02-19 00:16:53,694 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-19 00:16:53,694 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-19 00:16:53,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:16:53 BoogieIcfgContainer [2023-02-19 00:16:53,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-19 00:16:53,696 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-19 00:16:53,696 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-19 00:16:53,699 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-19 00:16:53,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:16:53,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.02 12:16:53" (1/3) ... [2023-02-19 00:16:53,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e29d452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.02 12:16:53, skipping insertion in model container [2023-02-19 00:16:53,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:16:53,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:16:53" (2/3) ... [2023-02-19 00:16:53,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e29d452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.02 12:16:53, skipping insertion in model container [2023-02-19 00:16:53,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:16:53,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:16:53" (3/3) ... [2023-02-19 00:16:53,701 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2023-02-19 00:16:53,735 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-19 00:16:53,736 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-19 00:16:53,736 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-19 00:16:53,736 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-19 00:16:53,736 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-19 00:16:53,736 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-19 00:16:53,736 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-19 00:16:53,736 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-19 00:16:53,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:53,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:16:53,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:53,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:53,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-19 00:16:53,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:53,754 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-19 00:16:53,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:53,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:16:53,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:53,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:53,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-19 00:16:53,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:53,760 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2023-02-19 00:16:53,761 INFO L750 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2023-02-19 00:16:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-19 00:16:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:53,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750156770] [2023-02-19 00:16:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:53,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:53,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2023-02-19 00:16:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:53,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078960527] [2023-02-19 00:16:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:53,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078960527] [2023-02-19 00:16:53,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078960527] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:53,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:53,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-19 00:16:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421952944] [2023-02-19 00:16:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:53,900 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:16:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-19 00:16:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-19 00:16:53,927 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:53,950 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2023-02-19 00:16:53,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2023-02-19 00:16:53,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:53,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2023-02-19 00:16:53,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-19 00:16:53,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-19 00:16:53,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-02-19 00:16:53,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-19 00:16:53,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-19 00:16:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-02-19 00:16:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-19 00:16:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-02-19 00:16:53,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-19 00:16:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-19 00:16:53,980 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-02-19 00:16:53,981 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-19 00:16:53,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-02-19 00:16:53,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:53,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:53,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:53,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-19 00:16:53,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:53,983 INFO L748 eck$LassoCheckResult]: Stem: 45#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 46#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 50#L26-1 [2023-02-19 00:16:53,984 INFO L750 eck$LassoCheckResult]: Loop: 50#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 56#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 53#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 51#L17-1 assume !(1 == main_~up~0#1); 52#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 48#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 50#L26-1 [2023-02-19 00:16:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-19 00:16:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:53,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661150131] [2023-02-19 00:16:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:53,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:53,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2023-02-19 00:16:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064460274] [2023-02-19 00:16:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:54,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064460274] [2023-02-19 00:16:54,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064460274] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:54,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:54,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-19 00:16:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093264446] [2023-02-19 00:16:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:54,054 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:16:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-19 00:16:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-19 00:16:54,056 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:54,092 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-02-19 00:16:54,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2023-02-19 00:16:54,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-19 00:16:54,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2023-02-19 00:16:54,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-19 00:16:54,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-19 00:16:54,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2023-02-19 00:16:54,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-19 00:16:54,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-19 00:16:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2023-02-19 00:16:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-19 00:16:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-02-19 00:16:54,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-19 00:16:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-19 00:16:54,105 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-02-19 00:16:54,105 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-19 00:16:54,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2023-02-19 00:16:54,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-19 00:16:54,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:54,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:54,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-19 00:16:54,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:54,107 INFO L748 eck$LassoCheckResult]: Stem: 104#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 109#L26-1 [2023-02-19 00:16:54,107 INFO L750 eck$LassoCheckResult]: Loop: 109#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 126#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 123#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 120#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 121#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 118#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 109#L26-1 [2023-02-19 00:16:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-19 00:16:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379010769] [2023-02-19 00:16:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2023-02-19 00:16:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712017069] [2023-02-19 00:16:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712017069] [2023-02-19 00:16:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712017069] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-19 00:16:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620351075] [2023-02-19 00:16:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:54,142 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:16:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-19 00:16:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-19 00:16:54,143 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:54,158 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2023-02-19 00:16:54,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2023-02-19 00:16:54,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-19 00:16:54,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2023-02-19 00:16:54,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-02-19 00:16:54,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-02-19 00:16:54,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2023-02-19 00:16:54,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-19 00:16:54,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-02-19 00:16:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2023-02-19 00:16:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-19 00:16:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-19 00:16:54,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-19 00:16:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-19 00:16:54,179 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-19 00:16:54,179 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-19 00:16:54,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-19 00:16:54,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-19 00:16:54,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:54,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:54,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-19 00:16:54,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:54,180 INFO L748 eck$LassoCheckResult]: Stem: 186#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 190#L26-1 [2023-02-19 00:16:54,180 INFO L750 eck$LassoCheckResult]: Loop: 190#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 201#L14 assume !(0 == main_~i~0#1); 207#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 205#L17-1 assume !(1 == main_~up~0#1); 204#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 202#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 190#L26-1 [2023-02-19 00:16:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-02-19 00:16:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337841832] [2023-02-19 00:16:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2023-02-19 00:16:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015765666] [2023-02-19 00:16:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2023-02-19 00:16:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512683634] [2023-02-19 00:16:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,217 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:54,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:54,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:54,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:54,218 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:16:54,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:54,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:54,218 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-19 00:16:54,218 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:54,218 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:54,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,244 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,255 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:54,257 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:16:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,267 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) [2023-02-19 00:16:54,269 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 [2023-02-19 00:16:54,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:54,287 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:16:54,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-02-19 00:16:54,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,293 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) [2023-02-19 00:16:54,294 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 [2023-02-19 00:16:54,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:54,308 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:16:54,310 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 [2023-02-19 00:16:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,312 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) [2023-02-19 00:16:54,313 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 [2023-02-19 00:16:54,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,342 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) [2023-02-19 00:16:54,343 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 [2023-02-19 00:16:54,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:16:54,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,366 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:16:54,369 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 [2023-02-19 00:16:54,369 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:54,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:54,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:54,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:54,369 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:16:54,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,369 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:54,369 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:54,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-02-19 00:16:54,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:54,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:54,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,375 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:54,386 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:16:54,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,397 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) [2023-02-19 00:16:54,398 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 [2023-02-19 00:16:54,399 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 [2023-02-19 00:16:54,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:54,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:54,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:16:54,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:54,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:16:54,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:16:54,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:54,436 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 [2023-02-19 00:16:54,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,438 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) [2023-02-19 00:16:54,441 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 [2023-02-19 00:16:54,442 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 [2023-02-19 00:16:54,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:54,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:54,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:54,449 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:54,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:54,451 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:54,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:54,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:16:54,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-19 00:16:54,468 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-19 00:16:54,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,470 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) [2023-02-19 00:16:54,471 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 [2023-02-19 00:16:54,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:16:54,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:16:54,474 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:16:54,474 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-19 00:16:54,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:54,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:16:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:54,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-19 00:16:54,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:54,570 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 [2023-02-19 00:16:54,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:54,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2023-02-19 00:16:54,622 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 [2023-02-19 00:16:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-19 00:16:54,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-19 00:16:54,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:54,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2023-02-19 00:16:54,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:54,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2023-02-19 00:16:54,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:54,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2023-02-19 00:16:54,628 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2023-02-19 00:16:54,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2023-02-19 00:16:54,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-02-19 00:16:54,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-02-19 00:16:54,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2023-02-19 00:16:54,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:54,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-02-19 00:16:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2023-02-19 00:16:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-02-19 00:16:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2023-02-19 00:16:54,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-19 00:16:54,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-02-19 00:16:54,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-19 00:16:54,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2023-02-19 00:16:54,636 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2023-02-19 00:16:54,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:54,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:54,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-19 00:16:54,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:54,636 INFO L748 eck$LassoCheckResult]: Stem: 367#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 378#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2023-02-19 00:16:54,636 INFO L750 eck$LassoCheckResult]: Loop: 386#L14 assume !(0 == main_~i~0#1); 437#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 433#L17-1 assume !(1 == main_~up~0#1); 430#L20-1 assume !(0 == main_~up~0#1); 426#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 425#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2023-02-19 00:16:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-19 00:16:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493936901] [2023-02-19 00:16:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2023-02-19 00:16:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622976474] [2023-02-19 00:16:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2023-02-19 00:16:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317364410] [2023-02-19 00:16:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:54,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317364410] [2023-02-19 00:16:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317364410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:54,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-19 00:16:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857846715] [2023-02-19 00:16:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-19 00:16:54,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-19 00:16:54,691 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:54,699 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-02-19 00:16:54,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2023-02-19 00:16:54,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-19 00:16:54,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2023-02-19 00:16:54,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-19 00:16:54,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-19 00:16:54,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2023-02-19 00:16:54,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:54,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2023-02-19 00:16:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2023-02-19 00:16:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-02-19 00:16:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2023-02-19 00:16:54,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-19 00:16:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-19 00:16:54,705 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-02-19 00:16:54,706 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-19 00:16:54,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2023-02-19 00:16:54,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-19 00:16:54,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:54,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:54,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-19 00:16:54,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:54,707 INFO L748 eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 552#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 570#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 584#L14-2 [2023-02-19 00:16:54,707 INFO L750 eck$LassoCheckResult]: Loop: 584#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 595#L17-1 assume !(1 == main_~up~0#1); 593#L20-1 assume !(0 == main_~up~0#1); 590#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 538#L14 assume !(0 == main_~i~0#1); 584#L14-2 [2023-02-19 00:16:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-19 00:16:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945815367] [2023-02-19 00:16:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2023-02-19 00:16:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083801487] [2023-02-19 00:16:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2023-02-19 00:16:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177915988] [2023-02-19 00:16:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:54,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177915988] [2023-02-19 00:16:54,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177915988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:54,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-19 00:16:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300941566] [2023-02-19 00:16:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-19 00:16:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-19 00:16:54,737 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:54,744 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-02-19 00:16:54,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2023-02-19 00:16:54,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-19 00:16:54,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2023-02-19 00:16:54,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-19 00:16:54,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-19 00:16:54,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2023-02-19 00:16:54,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:54,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-02-19 00:16:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2023-02-19 00:16:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2023-02-19 00:16:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-02-19 00:16:54,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-19 00:16:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-19 00:16:54,749 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-02-19 00:16:54,749 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-19 00:16:54,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2023-02-19 00:16:54,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-19 00:16:54,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:54,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:54,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-19 00:16:54,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:54,750 INFO L748 eck$LassoCheckResult]: Stem: 663#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 676#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 677#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 678#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2023-02-19 00:16:54,750 INFO L750 eck$LassoCheckResult]: Loop: 685#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 665#L20-1 assume !(0 == main_~up~0#1); 666#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 691#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 689#L14 assume !(0 == main_~i~0#1); 687#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2023-02-19 00:16:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-19 00:16:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90581152] [2023-02-19 00:16:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2023-02-19 00:16:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698972292] [2023-02-19 00:16:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2023-02-19 00:16:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:54,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602317448] [2023-02-19 00:16:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:54,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:54,778 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:54,778 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:54,778 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:54,778 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:54,778 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:16:54,778 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,778 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:54,778 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:54,778 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-19 00:16:54,779 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:54,779 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:54,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,781 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:54,785 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:54,785 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:16:54,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,786 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) [2023-02-19 00:16:54,788 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 [2023-02-19 00:16:54,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:54,811 INFO L440 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: [] [2023-02-19 00:16:54,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:54,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,818 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) [2023-02-19 00:16:54,820 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 [2023-02-19 00:16:54,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:54,849 INFO L440 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: [] [2023-02-19 00:16:54,854 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 [2023-02-19 00:16:54,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,856 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) [2023-02-19 00:16:54,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,865 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 [2023-02-19 00:16:54,881 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:54,881 INFO L440 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: [] [2023-02-19 00:16:54,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:54,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,887 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) [2023-02-19 00:16:54,888 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 [2023-02-19 00:16:54,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:54,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:54,911 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 [2023-02-19 00:16:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:54,913 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) [2023-02-19 00:16:54,916 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 [2023-02-19 00:16:54,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:16:54,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:55,083 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:16:55,086 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 [2023-02-19 00:16:55,087 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:55,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:55,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:55,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:55,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:16:55,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:55,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:55,087 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-02-19 00:16:55,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:55,087 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:55,089 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,089 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,090 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,091 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:55,094 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:16:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,095 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) [2023-02-19 00:16:55,097 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 [2023-02-19 00:16:55,099 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 [2023-02-19 00:16:55,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:55,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:55,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:16:55,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:55,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:16:55,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:16:55,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:55,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,136 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) [2023-02-19 00:16:55,141 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 [2023-02-19 00:16:55,143 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 [2023-02-19 00:16:55,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:55,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:55,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:16:55,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:55,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:16:55,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:16:55,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:55,171 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 [2023-02-19 00:16:55,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,172 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) [2023-02-19 00:16:55,173 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 [2023-02-19 00:16:55,179 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 [2023-02-19 00:16:55,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:55,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:55,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:55,185 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:55,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:55,186 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:55,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:55,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:55,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,199 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) [2023-02-19 00:16:55,201 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 [2023-02-19 00:16:55,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 [2023-02-19 00:16:55,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:55,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:55,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:55,211 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:55,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:55,213 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:55,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:55,229 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:16:55,232 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-19 00:16:55,232 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-19 00:16:55,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,234 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) [2023-02-19 00:16:55,236 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 [2023-02-19 00:16:55,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:16:55,237 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:16:55,237 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:16:55,237 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-19 00:16:55,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:55,241 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:16:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,275 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 [2023-02-19 00:16:55,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,307 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 124 transitions. Complement of second has 7 states. [2023-02-19 00:16:55,313 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 [2023-02-19 00:16:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-19 00:16:55,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2023-02-19 00:16:55,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-19 00:16:55,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2023-02-19 00:16:55,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2023-02-19 00:16:55,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-19 00:16:55,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2023-02-19 00:16:55,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-19 00:16:55,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-19 00:16:55,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2023-02-19 00:16:55,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:55,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-02-19 00:16:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2023-02-19 00:16:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-02-19 00:16:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2023-02-19 00:16:55,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-19 00:16:55,319 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-02-19 00:16:55,319 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-19 00:16:55,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2023-02-19 00:16:55,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-19 00:16:55,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:55,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:55,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:16:55,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:55,326 INFO L748 eck$LassoCheckResult]: Stem: 853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 865#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 905#L14 assume !(0 == main_~i~0#1); 906#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 863#L17-1 assume !(1 == main_~up~0#1); 864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 896#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 898#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 919#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 918#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2023-02-19 00:16:55,326 INFO L750 eck$LassoCheckResult]: Loop: 917#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 916#L20-1 assume !(0 == main_~up~0#1); 859#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 860#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 884#L14 assume !(0 == main_~i~0#1); 882#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2023-02-19 00:16:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2023-02-19 00:16:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:55,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525669976] [2023-02-19 00:16:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525669976] [2023-02-19 00:16:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525669976] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:16:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6181616] [2023-02-19 00:16:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:16:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,362 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:16:55,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-19 00:16:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:16:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,439 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 [2023-02-19 00:16:55,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6181616] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:16:55,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:16:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-19 00:16:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171673896] [2023-02-19 00:16:55,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:16:55,441 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:16:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2023-02-19 00:16:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:55,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965900129] [2023-02-19 00:16:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:55,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:55,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:55,460 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:55,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:55,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:55,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:55,461 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:16:55,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:55,461 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:55,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-19 00:16:55,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:55,461 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:55,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:55,468 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:16:55,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,469 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) [2023-02-19 00:16:55,478 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 [2023-02-19 00:16:55,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:55,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:55,504 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 [2023-02-19 00:16:55,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,505 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) [2023-02-19 00:16:55,507 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 [2023-02-19 00:16:55,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:16:55,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:55,672 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:16:55,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:55,676 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:55,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:55,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:55,676 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:55,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:16:55,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:55,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:55,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-02-19 00:16:55,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:55,676 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:55,677 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,684 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,685 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:55,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:55,689 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:16:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,690 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) [2023-02-19 00:16:55,692 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 [2023-02-19 00:16:55,694 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 [2023-02-19 00:16:55,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:55,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:55,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:55,700 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:55,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:55,702 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:55,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:55,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:16:55,719 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-19 00:16:55,720 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-19 00:16:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:55,722 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) [2023-02-19 00:16:55,723 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 [2023-02-19 00:16:55,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:16:55,724 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:16:55,724 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:16:55,725 INFO L515 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 [] [2023-02-19 00:16:55,730 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 [2023-02-19 00:16:55,730 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:16:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,767 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 [2023-02-19 00:16:55,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 136 transitions. Complement of second has 7 states. [2023-02-19 00:16:55,799 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 [2023-02-19 00:16:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-02-19 00:16:55,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-19 00:16:55,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,803 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:16:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,841 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 [2023-02-19 00:16:55,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 174 transitions. Complement of second has 9 states. [2023-02-19 00:16:55,881 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 [2023-02-19 00:16:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-02-19 00:16:55,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-19 00:16:55,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,882 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:16:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-19 00:16:55,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:55,929 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 [2023-02-19 00:16:55,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 165 transitions. Complement of second has 8 states. [2023-02-19 00:16:55,956 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 [2023-02-19 00:16:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-02-19 00:16:55,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-19 00:16:55,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-19 00:16:55,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2023-02-19 00:16:55,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:55,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2023-02-19 00:16:55,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-19 00:16:55,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2023-02-19 00:16:55,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-19 00:16:55,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-02-19 00:16:55,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2023-02-19 00:16:55,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:55,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2023-02-19 00:16:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2023-02-19 00:16:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-02-19 00:16:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-02-19 00:16:55,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-02-19 00:16:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-19 00:16:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-19 00:16:55,974 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:56,030 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2023-02-19 00:16:56,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2023-02-19 00:16:56,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2023-02-19 00:16:56,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2023-02-19 00:16:56,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-02-19 00:16:56,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-02-19 00:16:56,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2023-02-19 00:16:56,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:56,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2023-02-19 00:16:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2023-02-19 00:16:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2023-02-19 00:16:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2023-02-19 00:16:56,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-19 00:16:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-19 00:16:56,064 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-02-19 00:16:56,064 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-19 00:16:56,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2023-02-19 00:16:56,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2023-02-19 00:16:56,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:56,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:56,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-19 00:16:56,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-19 00:16:56,066 INFO L748 eck$LassoCheckResult]: Stem: 1787#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1788#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1793#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1867#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1866#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1849#L17-1 [2023-02-19 00:16:56,066 INFO L750 eck$LassoCheckResult]: Loop: 1849#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1862#L20-1 assume !(0 == main_~up~0#1); 1860#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1856#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1851#L14 assume !(0 == main_~i~0#1); 1848#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1838#L17-1 assume !(1 == main_~up~0#1); 1846#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1847#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1845#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume !(0 == main_~i~0#1); 1837#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1834#L17-1 assume !(1 == main_~up~0#1); 1832#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1829#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1830#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1841#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1842#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1849#L17-1 [2023-02-19 00:16:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2023-02-19 00:16:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102308092] [2023-02-19 00:16:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2023-02-19 00:16:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913774201] [2023-02-19 00:16:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913774201] [2023-02-19 00:16:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913774201] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:16:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082756864] [2023-02-19 00:16:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:16:56,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:56,186 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:16:56,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-19 00:16:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-19 00:16:56,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:16:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082756864] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:16:56,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:16:56,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-02-19 00:16:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134068084] [2023-02-19 00:16:56,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:16:56,261 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:16:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-19 00:16:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-19 00:16:56,262 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:56,384 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-02-19 00:16:56,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2023-02-19 00:16:56,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-19 00:16:56,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2023-02-19 00:16:56,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-19 00:16:56,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-02-19 00:16:56,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2023-02-19 00:16:56,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:56,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-02-19 00:16:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2023-02-19 00:16:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-19 00:16:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-02-19 00:16:56,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-19 00:16:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-19 00:16:56,390 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-02-19 00:16:56,390 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-19 00:16:56,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2023-02-19 00:16:56,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-19 00:16:56,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:56,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:56,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2023-02-19 00:16:56,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:16:56,392 INFO L748 eck$LassoCheckResult]: Stem: 2200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2206#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2231#L14 assume !(0 == main_~i~0#1); 2229#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2227#L17-1 assume !(1 == main_~up~0#1); 2225#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2220#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2219#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2213#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2267#L17-1 assume !(1 == main_~up~0#1); 2266#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2265#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2250#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2260#L14 assume !(0 == main_~i~0#1); 2258#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2256#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2249#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2243#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2023-02-19 00:16:56,392 INFO L750 eck$LassoCheckResult]: Loop: 2244#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2208#L20-1 assume !(0 == main_~up~0#1); 2273#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2272#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2271#L14 assume !(0 == main_~i~0#1); 2269#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2268#L17-1 assume !(1 == main_~up~0#1); 2254#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2251#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2245#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2246#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2023-02-19 00:16:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2023-02-19 00:16:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913055079] [2023-02-19 00:16:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913055079] [2023-02-19 00:16:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913055079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:16:56,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081328154] [2023-02-19 00:16:56,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-19 00:16:56,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:16:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:56,473 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:16:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-19 00:16:56,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-19 00:16:56,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:16:56,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-19 00:16:56,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:16:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081328154] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:16:56,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:16:56,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-02-19 00:16:56,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046319821] [2023-02-19 00:16:56,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:16:56,532 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:16:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2023-02-19 00:16:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152541235] [2023-02-19 00:16:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-19 00:16:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-19 00:16:56,542 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 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) [2023-02-19 00:16:56,625 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 [2023-02-19 00:16:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:56,645 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2023-02-19 00:16:56,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 187 transitions. [2023-02-19 00:16:56,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-19 00:16:56,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 165 states and 177 transitions. [2023-02-19 00:16:56,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2023-02-19 00:16:56,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2023-02-19 00:16:56,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 177 transitions. [2023-02-19 00:16:56,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:56,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 177 transitions. [2023-02-19 00:16:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 177 transitions. [2023-02-19 00:16:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2023-02-19 00:16:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.080536912751678) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2023-02-19 00:16:56,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-19 00:16:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-19 00:16:56,650 INFO L428 stractBuchiCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-19 00:16:56,650 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-19 00:16:56,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 161 transitions. [2023-02-19 00:16:56,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-19 00:16:56,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:56,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:56,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1] [2023-02-19 00:16:56,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:16:56,653 INFO L748 eck$LassoCheckResult]: Stem: 2623#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2636#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume !(0 == main_~i~0#1); 2647#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2646#L17-1 assume !(1 == main_~up~0#1); 2645#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2642#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2641#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2638#L14 assume !(0 == main_~i~0#1); 2639#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2634#L17-1 assume !(1 == main_~up~0#1); 2635#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2745#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2744#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2743#L14 assume !(0 == main_~i~0#1); 2742#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2741#L17-1 assume !(1 == main_~up~0#1); 2740#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2739#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2738#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2737#L14 assume !(0 == main_~i~0#1); 2736#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2735#L17-1 assume !(1 == main_~up~0#1); 2734#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2733#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2732#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2731#L14 assume !(0 == main_~i~0#1); 2730#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2729#L17-1 assume !(1 == main_~up~0#1); 2728#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2727#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2726#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2725#L14 assume !(0 == main_~i~0#1); 2724#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2723#L17-1 assume !(1 == main_~up~0#1); 2722#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2721#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2720#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2719#L14 assume !(0 == main_~i~0#1); 2718#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2717#L17-1 assume !(1 == main_~up~0#1); 2716#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2715#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2667#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2688#L14 assume !(0 == main_~i~0#1); 2676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2670#L17-1 assume !(1 == main_~up~0#1); 2668#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2665#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2666#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2673#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2669#L14-2 [2023-02-19 00:16:56,653 INFO L750 eck$LassoCheckResult]: Loop: 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2632#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2633#L20-1 assume !(0 == main_~up~0#1); 2685#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2684#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2683#L14 assume !(0 == main_~i~0#1); 2682#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2681#L17-1 assume !(1 == main_~up~0#1); 2680#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2678#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2674#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2675#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2669#L14-2 [2023-02-19 00:16:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 118659310, now seen corresponding path program 3 times [2023-02-19 00:16:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079884005] [2023-02-19 00:16:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079884005] [2023-02-19 00:16:56,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079884005] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:16:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984935107] [2023-02-19 00:16:56,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-19 00:16:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:16:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:56,756 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:16:56,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-19 00:16:56,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-19 00:16:56,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:16:56,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:16:56,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:16:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:56,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984935107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:16:56,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:16:56,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-02-19 00:16:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454220793] [2023-02-19 00:16:56,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:16:56,940 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:16:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2023-02-19 00:16:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:56,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652032908] [2023-02-19 00:16:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:56,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:56,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:56,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-19 00:16:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=282, Unknown=0, NotChecked=0, Total=462 [2023-02-19 00:16:56,950 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. cyclomatic complexity: 16 Second operand has 22 states, 21 states have (on average 5.523809523809524) internal successors, (116), 22 states have internal predecessors, (116), 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) [2023-02-19 00:16:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:57,119 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2023-02-19 00:16:57,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 309 transitions. [2023-02-19 00:16:57,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-19 00:16:57,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 277 states and 289 transitions. [2023-02-19 00:16:57,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2023-02-19 00:16:57,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2023-02-19 00:16:57,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 289 transitions. [2023-02-19 00:16:57,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:57,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 277 states and 289 transitions. [2023-02-19 00:16:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 289 transitions. [2023-02-19 00:16:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 269. [2023-02-19 00:16:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 1.0446096654275092) internal successors, (281), 268 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 281 transitions. [2023-02-19 00:16:57,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 281 transitions. [2023-02-19 00:16:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-19 00:16:57,129 INFO L428 stractBuchiCegarLoop]: Abstraction has 269 states and 281 transitions. [2023-02-19 00:16:57,130 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-19 00:16:57,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 281 transitions. [2023-02-19 00:16:57,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-02-19 00:16:57,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:57,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:57,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 18, 17, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1] [2023-02-19 00:16:57,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-19 00:16:57,142 INFO L748 eck$LassoCheckResult]: Stem: 3428#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3434#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3457#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3461#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3459#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3432#L20-1 assume !(0 == main_~up~0#1); 3433#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3464#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3478#L14 assume !(0 == main_~i~0#1); 3475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3476#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3430#L20-1 assume !(0 == main_~up~0#1); 3431#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3439#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3690#L14 assume !(0 == main_~i~0#1); 3688#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3686#L17-1 assume !(1 == main_~up~0#1); 3684#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3682#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3680#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3679#L14 assume !(0 == main_~i~0#1); 3678#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3677#L17-1 assume !(1 == main_~up~0#1); 3676#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3675#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3674#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3673#L14 assume !(0 == main_~i~0#1); 3672#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3671#L17-1 assume !(1 == main_~up~0#1); 3670#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3669#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3668#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3667#L14 assume !(0 == main_~i~0#1); 3666#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3665#L17-1 assume !(1 == main_~up~0#1); 3664#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3663#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3662#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3661#L14 assume !(0 == main_~i~0#1); 3660#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3659#L17-1 assume !(1 == main_~up~0#1); 3658#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3657#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3655#L14 assume !(0 == main_~i~0#1); 3654#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3653#L17-1 assume !(1 == main_~up~0#1); 3652#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3651#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3650#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3649#L14 assume !(0 == main_~i~0#1); 3648#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3647#L17-1 assume !(1 == main_~up~0#1); 3646#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3645#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3644#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3643#L14 assume !(0 == main_~i~0#1); 3642#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3641#L17-1 assume !(1 == main_~up~0#1); 3640#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3639#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3638#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3637#L14 assume !(0 == main_~i~0#1); 3636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3635#L17-1 assume !(1 == main_~up~0#1); 3634#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3633#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3632#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3631#L14 assume !(0 == main_~i~0#1); 3630#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3629#L17-1 assume !(1 == main_~up~0#1); 3628#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3627#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3626#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3625#L14 assume !(0 == main_~i~0#1); 3624#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3623#L17-1 assume !(1 == main_~up~0#1); 3622#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3621#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3620#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3619#L14 assume !(0 == main_~i~0#1); 3618#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3617#L17-1 assume !(1 == main_~up~0#1); 3616#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3615#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3614#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3613#L14 assume !(0 == main_~i~0#1); 3612#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3611#L17-1 assume !(1 == main_~up~0#1); 3610#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3609#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3608#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3607#L14 assume !(0 == main_~i~0#1); 3606#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3605#L17-1 assume !(1 == main_~up~0#1); 3604#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3603#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3602#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3601#L14 assume !(0 == main_~i~0#1); 3600#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3599#L17-1 assume !(1 == main_~up~0#1); 3598#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3597#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3596#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3595#L14 assume !(0 == main_~i~0#1); 3594#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3593#L17-1 assume !(1 == main_~up~0#1); 3592#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3591#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3590#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3589#L14 assume !(0 == main_~i~0#1); 3587#L14-2 [2023-02-19 00:16:57,142 INFO L750 eck$LassoCheckResult]: Loop: 3587#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3484#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3482#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3587#L14-2 [2023-02-19 00:16:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:57,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1500809642, now seen corresponding path program 1 times [2023-02-19 00:16:57,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:57,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795903694] [2023-02-19 00:16:57,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2023-02-19 00:16:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:57,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795903694] [2023-02-19 00:16:57,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795903694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:16:57,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:16:57,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-19 00:16:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424001177] [2023-02-19 00:16:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:16:57,262 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:16:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1544193778, now seen corresponding path program 1 times [2023-02-19 00:16:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:57,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237084540] [2023-02-19 00:16:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:57,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:57,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:57,268 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:57,268 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:57,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:57,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:57,268 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:16:57,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:57,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:57,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2023-02-19 00:16:57,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:57,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:57,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,274 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:57,274 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:16:57,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,285 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) [2023-02-19 00:16:57,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:57,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:57,301 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 [2023-02-19 00:16:57,321 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:57,321 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:16:57,326 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 [2023-02-19 00:16:57,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,328 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) [2023-02-19 00:16:57,331 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 [2023-02-19 00:16:57,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:57,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:57,353 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:16:57,353 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:16:57,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:57,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,359 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) [2023-02-19 00:16:57,361 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 [2023-02-19 00:16:57,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:16:57,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:57,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-19 00:16:57,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,388 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) [2023-02-19 00:16:57,398 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 [2023-02-19 00:16:57,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:16:57,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:16:57,511 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:16:57,515 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 [2023-02-19 00:16:57,515 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:16:57,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:16:57,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:16:57,515 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:16:57,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:16:57,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:16:57,516 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:16:57,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration12_Loop [2023-02-19 00:16:57,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:16:57,516 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:16:57,517 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,519 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:16:57,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:16:57,537 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:16:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,549 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) [2023-02-19 00:16:57,552 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 [2023-02-19 00:16:57,553 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 [2023-02-19 00:16:57,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:57,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:57,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:57,560 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:57,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:57,561 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:57,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:57,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:57,587 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 [2023-02-19 00:16:57,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,589 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) [2023-02-19 00:16:57,598 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 [2023-02-19 00:16:57,599 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 [2023-02-19 00:16:57,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:57,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:57,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:16:57,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:57,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:16:57,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:16:57,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:16:57,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-02-19 00:16:57,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,657 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) [2023-02-19 00:16:57,658 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 [2023-02-19 00:16:57,661 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 [2023-02-19 00:16:57,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:16:57,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:16:57,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:16:57,667 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:16:57,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:16:57,669 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:16:57,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:16:57,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:16:57,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-19 00:16:57,675 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-19 00:16:57,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:16:57,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:57,676 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) [2023-02-19 00:16:57,676 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 [2023-02-19 00:16:57,679 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:16:57,679 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:16:57,679 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:16:57,679 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1) = 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-19 00:16:57,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-19 00:16:57,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:16:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-19 00:16:57,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-19 00:16:57,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:57,774 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 [2023-02-19 00:16:57,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 281 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:57,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 281 transitions. cyclomatic complexity: 16. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 550 states and 592 transitions. Complement of second has 6 states. [2023-02-19 00:16:57,797 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 [2023-02-19 00:16:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-19 00:16:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-02-19 00:16:57,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 112 letters. Loop has 6 letters. [2023-02-19 00:16:57,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:57,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 118 letters. Loop has 6 letters. [2023-02-19 00:16:57,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:57,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 112 letters. Loop has 12 letters. [2023-02-19 00:16:57,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:16:57,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 550 states and 592 transitions. [2023-02-19 00:16:57,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:57,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 550 states to 324 states and 350 transitions. [2023-02-19 00:16:57,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-02-19 00:16:57,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-19 00:16:57,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 350 transitions. [2023-02-19 00:16:57,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:57,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 324 states and 350 transitions. [2023-02-19 00:16:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 350 transitions. [2023-02-19 00:16:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2023-02-19 00:16:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.077922077922078) internal successors, (332), 307 states have internal predecessors, (332), 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) [2023-02-19 00:16:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 332 transitions. [2023-02-19 00:16:57,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 332 transitions. [2023-02-19 00:16:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-19 00:16:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-19 00:16:57,806 INFO L87 Difference]: Start difference. First operand 308 states and 332 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2023-02-19 00:16:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:57,828 INFO L93 Difference]: Finished difference Result 319 states and 342 transitions. [2023-02-19 00:16:57,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 342 transitions. [2023-02-19 00:16:57,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:57,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 313 states and 333 transitions. [2023-02-19 00:16:57,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-19 00:16:57,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-19 00:16:57,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 333 transitions. [2023-02-19 00:16:57,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:57,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 313 states and 333 transitions. [2023-02-19 00:16:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 333 transitions. [2023-02-19 00:16:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2023-02-19 00:16:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.0627062706270627) internal successors, (322), 302 states have internal predecessors, (322), 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) [2023-02-19 00:16:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 322 transitions. [2023-02-19 00:16:57,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 303 states and 322 transitions. [2023-02-19 00:16:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-19 00:16:57,835 INFO L428 stractBuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2023-02-19 00:16:57,835 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-19 00:16:57,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 322 transitions. [2023-02-19 00:16:57,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:57,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:57,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:57,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 18, 18, 1, 1, 1] [2023-02-19 00:16:57,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:16:57,837 INFO L748 eck$LassoCheckResult]: Stem: 5256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 5266#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5285#L14 assume !(0 == main_~i~0#1); 5412#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5410#L17-1 assume !(1 == main_~up~0#1); 5408#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5405#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5403#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5402#L14 assume !(0 == main_~i~0#1); 5401#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5400#L17-1 assume !(1 == main_~up~0#1); 5399#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5398#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5397#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5396#L14 assume !(0 == main_~i~0#1); 5395#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5394#L17-1 assume !(1 == main_~up~0#1); 5393#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5392#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5391#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5390#L14 assume !(0 == main_~i~0#1); 5389#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5388#L17-1 assume !(1 == main_~up~0#1); 5387#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5386#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5385#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5384#L14 assume !(0 == main_~i~0#1); 5383#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5382#L17-1 assume !(1 == main_~up~0#1); 5381#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5380#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5379#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5378#L14 assume !(0 == main_~i~0#1); 5377#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5376#L17-1 assume !(1 == main_~up~0#1); 5375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5374#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5373#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5372#L14 assume !(0 == main_~i~0#1); 5371#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5370#L17-1 assume !(1 == main_~up~0#1); 5369#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5368#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5367#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5366#L14 assume !(0 == main_~i~0#1); 5365#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5364#L17-1 assume !(1 == main_~up~0#1); 5363#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5362#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5361#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5360#L14 assume !(0 == main_~i~0#1); 5359#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5358#L17-1 assume !(1 == main_~up~0#1); 5357#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5356#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5355#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5354#L14 assume !(0 == main_~i~0#1); 5353#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5352#L17-1 assume !(1 == main_~up~0#1); 5351#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5350#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5349#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5348#L14 assume !(0 == main_~i~0#1); 5347#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5346#L17-1 assume !(1 == main_~up~0#1); 5345#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5344#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5343#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5342#L14 assume !(0 == main_~i~0#1); 5341#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5340#L17-1 assume !(1 == main_~up~0#1); 5339#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5338#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5337#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5336#L14 assume !(0 == main_~i~0#1); 5335#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5334#L17-1 assume !(1 == main_~up~0#1); 5333#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5332#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5331#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5330#L14 assume !(0 == main_~i~0#1); 5329#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5328#L17-1 assume !(1 == main_~up~0#1); 5327#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5326#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5325#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5324#L14 assume !(0 == main_~i~0#1); 5323#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5322#L17-1 assume !(1 == main_~up~0#1); 5321#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5320#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5319#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5318#L14 assume !(0 == main_~i~0#1); 5317#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5316#L17-1 assume !(1 == main_~up~0#1); 5315#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5314#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5313#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5312#L14 assume !(0 == main_~i~0#1); 5311#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5310#L17-1 assume !(1 == main_~up~0#1); 5309#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5308#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5298#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5306#L14 assume !(0 == main_~i~0#1); 5304#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5302#L17-1 assume !(1 == main_~up~0#1); 5300#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5297#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5294#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5280#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5278#L14-2 [2023-02-19 00:16:57,837 INFO L750 eck$LassoCheckResult]: Loop: 5278#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5276#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5258#L20-1 assume !(0 == main_~up~0#1); 5259#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5264#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5283#L14 assume !(0 == main_~i~0#1); 5279#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5277#L17-1 assume !(1 == main_~up~0#1); 5274#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5275#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5284#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5282#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5278#L14-2 [2023-02-19 00:16:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 123059224, now seen corresponding path program 4 times [2023-02-19 00:16:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:57,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776312338] [2023-02-19 00:16:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:16:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776312338] [2023-02-19 00:16:58,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776312338] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:16:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505138265] [2023-02-19 00:16:58,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-19 00:16:58,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:16:58,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:16:58,181 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:16:58,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-19 00:16:58,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-19 00:16:58,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:16:58,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-19 00:16:58,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:16:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:58,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:16:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:16:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505138265] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:16:58,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:16:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 24 [2023-02-19 00:16:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627822214] [2023-02-19 00:16:58,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:16:58,585 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:16:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2023-02-19 00:16:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508149469] [2023-02-19 00:16:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:58,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:16:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-19 00:16:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2023-02-19 00:16:58,596 INFO L87 Difference]: Start difference. First operand 303 states and 322 transitions. cyclomatic complexity: 25 Second operand has 25 states, 24 states have (on average 4.958333333333333) internal successors, (119), 25 states have internal predecessors, (119), 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) [2023-02-19 00:16:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:16:58,738 INFO L93 Difference]: Finished difference Result 423 states and 442 transitions. [2023-02-19 00:16:58,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 442 transitions. [2023-02-19 00:16:58,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:58,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 421 states and 440 transitions. [2023-02-19 00:16:58,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-19 00:16:58,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-19 00:16:58,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 440 transitions. [2023-02-19 00:16:58,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:16:58,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 421 states and 440 transitions. [2023-02-19 00:16:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 440 transitions. [2023-02-19 00:16:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 315. [2023-02-19 00:16:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.0603174603174603) internal successors, (334), 314 states have internal predecessors, (334), 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) [2023-02-19 00:16:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 334 transitions. [2023-02-19 00:16:58,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 334 transitions. [2023-02-19 00:16:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-19 00:16:58,747 INFO L428 stractBuchiCegarLoop]: Abstraction has 315 states and 334 transitions. [2023-02-19 00:16:58,747 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-19 00:16:58,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 334 transitions. [2023-02-19 00:16:58,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-19 00:16:58,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:16:58,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:16:58,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2023-02-19 00:16:58,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:16:58,753 INFO L748 eck$LassoCheckResult]: Stem: 6688#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 6694#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6713#L14 assume !(0 == main_~i~0#1); 6741#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6740#L17-1 assume !(1 == main_~up~0#1); 6739#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6736#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6737#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6866#L14 assume !(0 == main_~i~0#1); 6865#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6864#L17-1 assume !(1 == main_~up~0#1); 6863#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6862#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6861#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6860#L14 assume !(0 == main_~i~0#1); 6859#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6858#L17-1 assume !(1 == main_~up~0#1); 6857#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6856#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6855#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6854#L14 assume !(0 == main_~i~0#1); 6853#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6852#L17-1 assume !(1 == main_~up~0#1); 6851#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6850#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6849#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6848#L14 assume !(0 == main_~i~0#1); 6847#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6846#L17-1 assume !(1 == main_~up~0#1); 6845#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6844#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6843#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6842#L14 assume !(0 == main_~i~0#1); 6841#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6840#L17-1 assume !(1 == main_~up~0#1); 6839#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6838#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6837#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6836#L14 assume !(0 == main_~i~0#1); 6835#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6834#L17-1 assume !(1 == main_~up~0#1); 6833#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6832#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6831#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6830#L14 assume !(0 == main_~i~0#1); 6829#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6828#L17-1 assume !(1 == main_~up~0#1); 6827#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6826#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6825#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6824#L14 assume !(0 == main_~i~0#1); 6823#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6822#L17-1 assume !(1 == main_~up~0#1); 6821#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6820#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6819#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6818#L14 assume !(0 == main_~i~0#1); 6817#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6816#L17-1 assume !(1 == main_~up~0#1); 6815#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6814#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6813#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6812#L14 assume !(0 == main_~i~0#1); 6811#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6810#L17-1 assume !(1 == main_~up~0#1); 6809#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6808#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6807#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6806#L14 assume !(0 == main_~i~0#1); 6805#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6804#L17-1 assume !(1 == main_~up~0#1); 6803#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6802#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6801#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6800#L14 assume !(0 == main_~i~0#1); 6799#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6798#L17-1 assume !(1 == main_~up~0#1); 6797#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6796#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6795#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6794#L14 assume !(0 == main_~i~0#1); 6793#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6792#L17-1 assume !(1 == main_~up~0#1); 6791#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6790#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6789#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6788#L14 assume !(0 == main_~i~0#1); 6787#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6786#L17-1 assume !(1 == main_~up~0#1); 6785#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6784#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6783#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6782#L14 assume !(0 == main_~i~0#1); 6781#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6780#L17-1 assume !(1 == main_~up~0#1); 6779#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6778#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6777#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6776#L14 assume !(0 == main_~i~0#1); 6775#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6774#L17-1 assume !(1 == main_~up~0#1); 6773#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6772#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6771#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6770#L14 assume !(0 == main_~i~0#1); 6769#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6768#L17-1 assume !(1 == main_~up~0#1); 6767#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6766#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6732#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6747#L14 assume !(0 == main_~i~0#1); 6745#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6743#L17-1 assume !(1 == main_~up~0#1); 6734#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6731#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6728#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6710#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6707#L14-2 [2023-02-19 00:16:58,753 INFO L750 eck$LassoCheckResult]: Loop: 6707#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6704#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6705#L20-1 assume !(0 == main_~up~0#1); 6715#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6714#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6712#L14 assume !(0 == main_~i~0#1); 6708#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6706#L17-1 assume !(1 == main_~up~0#1); 6690#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6691#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6698#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6709#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6707#L14-2 [2023-02-19 00:16:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2023-02-19 00:16:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:58,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031869288] [2023-02-19 00:16:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2023-02-19 00:16:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:58,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970370701] [2023-02-19 00:16:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:16:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 2 times [2023-02-19 00:16:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:16:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96857735] [2023-02-19 00:16:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:16:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:16:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:16:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:16:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:16:58,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.02 12:16:58 BoogieIcfgContainer [2023-02-19 00:16:58,970 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-19 00:16:58,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-19 00:16:58,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-19 00:16:58,971 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-19 00:16:58,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:16:53" (3/4) ... [2023-02-19 00:16:58,973 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-19 00:16:59,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-19 00:16:59,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-19 00:16:59,044 INFO L158 Benchmark]: Toolchain (without parser) took 5749.29ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 98.4MB in the beginning and 74.9MB in the end (delta: 23.5MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,044 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-19 00:16:59,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.02ms. Allocated memory is still 140.5MB. Free memory was 98.2MB in the beginning and 89.1MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.79ms. Allocated memory is still 140.5MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,045 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 140.5MB. Free memory was 87.0MB in the beginning and 86.1MB in the end (delta: 971.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-19 00:16:59,045 INFO L158 Benchmark]: RCFGBuilder took 210.05ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 77.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,045 INFO L158 Benchmark]: BuchiAutomizer took 5273.97ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 77.4MB in the beginning and 80.2MB in the end (delta: -2.8MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,045 INFO L158 Benchmark]: Witness Printer took 72.98ms. Allocated memory is still 180.4MB. Free memory was 80.2MB in the beginning and 74.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-19 00:16:59,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.02ms. Allocated memory is still 140.5MB. Free memory was 98.2MB in the beginning and 89.1MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.79ms. Allocated memory is still 140.5MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 140.5MB. Free memory was 87.0MB in the beginning and 86.1MB in the end (delta: 971.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 210.05ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 77.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5273.97ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 77.4MB in the beginning and 80.2MB in the end (delta: -2.8MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 72.98ms. Allocated memory is still 180.4MB. Free memory was 80.2MB in the beginning and 74.9MB in the end (delta: 5.2MB). 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 range + -1 * i and consists of 4 locations. One deterministic module has affine ranking function range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. The remainder module has 315 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 14 iterations. TraceHistogramMax:20. Analysis of lassos took 3.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 269 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, 562 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 196 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax134 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp100 dnf146 smp100 tf102 neg92 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 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! [2023-02-19 00:16:59,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:59,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-02-19 00:16:59,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:59,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-19 00:16:59,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:00,089 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)