./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 6c24879c 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-?-6c24879 [2022-07-13 03:11:17,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:11:17,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:11:17,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:11:17,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:11:17,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:11:17,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:11:17,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:11:17,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:11:17,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:11:17,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:11:17,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:11:17,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:11:17,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:11:17,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:11:17,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:11:17,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:11:17,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:11:17,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:11:17,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:11:17,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:11:17,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:11:17,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:11:17,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:11:17,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:11:17,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:11:17,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:11:17,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:11:17,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:11:17,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:11:17,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:11:17,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:11:17,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:11:17,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:11:17,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:11:17,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:11:17,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:11:17,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:11:17,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:11:17,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:11:17,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:11:17,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:11:17,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:11:17,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:11:17,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:11:17,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:11:17,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:11:17,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:11:17,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:11:17,768 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:11:17,768 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:11:17,768 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:11:17,769 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:11:17,769 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:11:17,769 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:11:17,769 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:11:17,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:11:17,770 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:11:17,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:11:17,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:11:17,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:11:17,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:11:17,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:11:17,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:11:17,772 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:11:17,772 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 [2022-07-13 03:11:17,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:11:17,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:11:17,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:11:17,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:11:17,957 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:11:17,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-07-13 03:11:18,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f956f871/adc6575b23244006b33e3769ee4987a0/FLAG7e7dcf0de [2022-07-13 03:11:18,381 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:11:18,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-07-13 03:11:18,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f956f871/adc6575b23244006b33e3769ee4987a0/FLAG7e7dcf0de [2022-07-13 03:11:18,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f956f871/adc6575b23244006b33e3769ee4987a0 [2022-07-13 03:11:18,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:11:18,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:11:18,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:11:18,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:11:18,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:11:18,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629d194a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18, skipping insertion in model container [2022-07-13 03:11:18,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:11:18,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:11:18,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:11:18,548 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:11:18,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:11:18,568 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:11:18,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18 WrapperNode [2022-07-13 03:11:18,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:11:18,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:11:18,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:11:18,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:11:18,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,618 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-07-13 03:11:18,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:11:18,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:11:18,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:11:18,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:11:18,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:11:18,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:11:18,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:11:18,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:11:18,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (1/1) ... [2022-07-13 03:11:18,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:18,649 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) [2022-07-13 03:11:18,655 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 [2022-07-13 03:11:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:11:18,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:11:18,713 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:11:18,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:11:18,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:11:18,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:11:18,767 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:11:18,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:18 BoogieIcfgContainer [2022-07-13 03:11:18,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:11:18,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:11:18,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:11:18,771 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:11:18,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:18,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:11:18" (1/3) ... [2022-07-13 03:11:18,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fbc7373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:11:18, skipping insertion in model container [2022-07-13 03:11:18,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:18,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:18" (2/3) ... [2022-07-13 03:11:18,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fbc7373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:11:18, skipping insertion in model container [2022-07-13 03:11:18,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:18,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:18" (3/3) ... [2022-07-13 03:11:18,774 INFO L354 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2022-07-13 03:11:18,806 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:11:18,807 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:11:18,807 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:11:18,807 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:11:18,807 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:11:18,807 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:11:18,807 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:11:18,808 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:11:18,810 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) [2022-07-13 03:11:18,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:11:18,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:18,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:18,824 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:18,824 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:18,824 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:11:18,824 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) [2022-07-13 03:11:18,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:11:18,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:18,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:18,826 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:18,826 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:18,830 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue 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 [2022-07-13 03:11:18,830 INFO L754 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; 6#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 [2022-07-13 03:11:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:11:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:18,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660381412] [2022-07-13 03:11:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:18,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:18,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2022-07-13 03:11:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:18,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046289076] [2022-07-13 03:11:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:18,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046289076] [2022-07-13 03:11:18,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046289076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:18,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:18,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:11:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159497136] [2022-07-13 03:11:18,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:18,954 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:11:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:11:18,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:11:18,978 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) [2022-07-13 03:11:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:18,994 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-07-13 03:11:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:11:18,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-07-13 03:11:18,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-13 03:11:19,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2022-07-13 03:11:19,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 03:11:19,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 03:11:19,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2022-07-13 03:11:19,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:11:19,008 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-13 03:11:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2022-07-13 03:11:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-13 03:11:19,023 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) [2022-07-13 03:11:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2022-07-13 03:11:19,025 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-13 03:11:19,025 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-13 03:11:19,025 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:11:19,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2022-07-13 03:11:19,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-13 03:11:19,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:19,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:19,026 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:19,026 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:19,026 INFO L752 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;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 [2022-07-13 03:11:19,026 INFO L754 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 [2022-07-13 03:11:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:11:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636007656] [2022-07-13 03:11:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2022-07-13 03:11:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746227915] [2022-07-13 03:11:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:19,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746227915] [2022-07-13 03:11:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746227915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:19,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:19,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:11:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411370618] [2022-07-13 03:11:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:19,057 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:11:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:11:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:11:19,058 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) [2022-07-13 03:11:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:19,090 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2022-07-13 03:11:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:11:19,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2022-07-13 03:11:19,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-13 03:11:19,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2022-07-13 03:11:19,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-13 03:11:19,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-13 03:11:19,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2022-07-13 03:11:19,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:11:19,094 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-13 03:11:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2022-07-13 03:11:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 03:11:19,097 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) [2022-07-13 03:11:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2022-07-13 03:11:19,098 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-13 03:11:19,098 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-13 03:11:19,098 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:11:19,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2022-07-13 03:11:19,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-13 03:11:19,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:19,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:19,100 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:19,100 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:19,100 INFO L752 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;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 [2022-07-13 03:11:19,100 INFO L754 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 [2022-07-13 03:11:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:11:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078398055] [2022-07-13 03:11:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2022-07-13 03:11:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106369716] [2022-07-13 03:11:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106369716] [2022-07-13 03:11:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106369716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:19,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:19,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:11:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759525935] [2022-07-13 03:11:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:19,121 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:11:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:19,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:11:19,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:11:19,121 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) [2022-07-13 03:11:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:19,132 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2022-07-13 03:11:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:11:19,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2022-07-13 03:11:19,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-13 03:11:19,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2022-07-13 03:11:19,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-13 03:11:19,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-13 03:11:19,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2022-07-13 03:11:19,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:11:19,135 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-07-13 03:11:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2022-07-13 03:11:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-13 03:11:19,138 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) [2022-07-13 03:11:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2022-07-13 03:11:19,138 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-13 03:11:19,139 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-13 03:11:19,139 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:11:19,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2022-07-13 03:11:19,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-07-13 03:11:19,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:19,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:19,140 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:19,140 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:19,140 INFO L752 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;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 [2022-07-13 03:11:19,140 INFO L754 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 [2022-07-13 03:11:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:11:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917482772] [2022-07-13 03:11:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2022-07-13 03:11:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363343050] [2022-07-13 03:11:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2022-07-13 03:11:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397337367] [2022-07-13 03:11:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,246 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:19,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:19,247 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:19,247 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:19,247 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:19,247 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:19,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:19,248 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-07-13 03:11:19,248 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:19,248 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:19,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,361 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:19,361 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:19,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,404 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) [2022-07-13 03:11:19,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:19,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:19,435 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 [2022-07-13 03:11:19,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:19,446 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: [] [2022-07-13 03:11:19,461 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 [2022-07-13 03:11:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,463 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) [2022-07-13 03:11:19,466 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 [2022-07-13 03:11:19,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:19,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:19,490 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:19,490 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: [] [2022-07-13 03:11:19,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-13 03:11:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,509 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) [2022-07-13 03:11:19,510 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 [2022-07-13 03:11:19,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:19,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:19,536 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 [2022-07-13 03:11:19,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,538 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) [2022-07-13 03:11:19,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:19,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:19,559 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 [2022-07-13 03:11:19,568 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:19,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:19,573 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:19,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:19,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:19,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:19,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:19,573 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,573 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:19,573 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:19,573 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-07-13 03:11:19,573 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:19,573 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:19,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:19,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:19,653 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,655 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) [2022-07-13 03:11:19,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 [2022-07-13 03:11:19,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:19,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:19,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:19,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:19,661 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 [2022-07-13 03:11:19,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:19,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:19,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:19,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:19,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,698 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) [2022-07-13 03:11:19,700 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 [2022-07-13 03:11:19,701 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 [2022-07-13 03:11:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:19,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:19,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:19,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:19,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:19,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:19,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:19,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:19,735 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:19,735 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:11:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:19,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:19,737 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) [2022-07-13 03:11:19,738 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 [2022-07-13 03:11:19,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:19,739 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:19,739 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:19,740 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 [] [2022-07-13 03:11:19,759 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 [2022-07-13 03:11:19,761 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:19,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:19,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:19,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:19,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:19,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:11:19,880 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) [2022-07-13 03:11:19,930 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. [2022-07-13 03:11:19,930 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 [2022-07-13 03:11:19,931 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) [2022-07-13 03:11:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-07-13 03:11:19,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-13 03:11:19,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:19,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-13 03:11:19,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:19,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2022-07-13 03:11:19,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:19,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2022-07-13 03:11:19,937 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2022-07-13 03:11:19,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2022-07-13 03:11:19,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-13 03:11:19,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-13 03:11:19,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2022-07-13 03:11:19,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:19,942 INFO L369 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2022-07-13 03:11:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2022-07-13 03:11:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2022-07-13 03:11:19,948 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) [2022-07-13 03:11:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2022-07-13 03:11:19,950 INFO L392 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-07-13 03:11:19,950 INFO L374 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-07-13 03:11:19,950 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:11:19,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2022-07-13 03:11:19,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2022-07-13 03:11:19,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:19,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:19,953 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:11:19,953 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:19,953 INFO L752 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 365#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; 379#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 387#L14 [2022-07-13 03:11:19,953 INFO L754 eck$LassoCheckResult]: Loop: 387#L14 assume !(0 == main_~i~0#1); 438#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 434#L17-1 assume !(1 == main_~up~0#1); 431#L20-1 assume !(0 == main_~up~0#1); 427#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 426#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 387#L14 [2022-07-13 03:11:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-07-13 03:11:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526488727] [2022-07-13 03:11:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2022-07-13 03:11:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082359935] [2022-07-13 03:11:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:19,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2022-07-13 03:11:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:19,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38769096] [2022-07-13 03:11:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:19,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:19,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38769096] [2022-07-13 03:11:19,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38769096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:19,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:19,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:11:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79667085] [2022-07-13 03:11:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:11:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:11:20,006 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) [2022-07-13 03:11:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:20,014 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-07-13 03:11:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:11:20,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2022-07-13 03:11:20,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2022-07-13 03:11:20,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2022-07-13 03:11:20,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-13 03:11:20,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-13 03:11:20,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2022-07-13 03:11:20,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:20,019 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-07-13 03:11:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2022-07-13 03:11:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-07-13 03:11:20,022 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) [2022-07-13 03:11:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-07-13 03:11:20,023 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-07-13 03:11:20,024 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-07-13 03:11:20,024 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:11:20,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2022-07-13 03:11:20,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-13 03:11:20,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:20,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:20,026 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:11:20,026 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:20,026 INFO L752 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 539#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; 553#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 571#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 585#L14-2 [2022-07-13 03:11:20,026 INFO L754 eck$LassoCheckResult]: Loop: 585#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 596#L17-1 assume !(1 == main_~up~0#1); 594#L20-1 assume !(0 == main_~up~0#1); 591#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 540#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 541#L14 assume !(0 == main_~i~0#1); 585#L14-2 [2022-07-13 03:11:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-07-13 03:11:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300283633] [2022-07-13 03:11:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2022-07-13 03:11:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742724361] [2022-07-13 03:11:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2022-07-13 03:11:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970006714] [2022-07-13 03:11:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:20,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970006714] [2022-07-13 03:11:20,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970006714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:20,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:20,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:11:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758301704] [2022-07-13 03:11:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:11:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:11:20,075 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) [2022-07-13 03:11:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:20,081 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-07-13 03:11:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:11:20,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2022-07-13 03:11:20,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:11:20,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2022-07-13 03:11:20,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-13 03:11:20,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-13 03:11:20,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2022-07-13 03:11:20,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:20,085 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-07-13 03:11:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2022-07-13 03:11:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-13 03:11:20,087 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) [2022-07-13 03:11:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-07-13 03:11:20,088 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-07-13 03:11:20,088 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-07-13 03:11:20,088 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:11:20,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2022-07-13 03:11:20,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:11:20,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:20,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:20,090 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:11:20,090 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:20,090 INFO L752 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 661#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; 677#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 678#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 679#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 686#L17-1 [2022-07-13 03:11:20,090 INFO L754 eck$LassoCheckResult]: Loop: 686#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 666#L20-1 assume !(0 == main_~up~0#1); 667#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 692#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 688#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 686#L17-1 [2022-07-13 03:11:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2022-07-13 03:11:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629371659] [2022-07-13 03:11:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2022-07-13 03:11:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177963742] [2022-07-13 03:11:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2022-07-13 03:11:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457119967] [2022-07-13 03:11:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:20,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:20,176 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:20,177 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:20,177 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:20,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:20,177 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:20,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:20,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:20,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-07-13 03:11:20,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:20,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:20,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,254 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 [2022-07-13 03:11:20,292 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:20,293 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,294 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) [2022-07-13 03:11:20,295 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 [2022-07-13 03:11:20,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:20,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:20,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:20,318 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: [] [2022-07-13 03:11:20,335 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 [2022-07-13 03:11:20,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,336 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) [2022-07-13 03:11:20,337 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 [2022-07-13 03:11:20,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:20,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:20,353 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:20,354 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: [] [2022-07-13 03:11:20,406 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 [2022-07-13 03:11:20,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,408 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) [2022-07-13 03:11:20,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:20,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:20,422 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 [2022-07-13 03:11:20,431 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:20,431 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: [] [2022-07-13 03:11:20,448 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 [2022-07-13 03:11:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,450 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) [2022-07-13 03:11:20,451 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 [2022-07-13 03:11:20,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:20,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:20,491 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 [2022-07-13 03:11:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,493 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) [2022-07-13 03:11:20,494 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 [2022-07-13 03:11:20,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:20,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:20,698 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:20,702 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 [2022-07-13 03:11:20,702 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:20,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:20,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:20,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:20,702 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:20,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:20,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:20,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-07-13 03:11:20,703 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:20,703 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:20,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:20,782 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:20,783 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:20,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,784 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) [2022-07-13 03:11:20,785 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 [2022-07-13 03:11:20,787 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 [2022-07-13 03:11:20,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:20,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:20,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:20,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:20,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:20,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:20,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:20,825 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 [2022-07-13 03:11:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,826 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) [2022-07-13 03:11:20,827 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 [2022-07-13 03:11:20,829 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 [2022-07-13 03:11:20,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:20,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:20,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:20,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:20,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:20,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:20,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:20,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:20,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,860 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) [2022-07-13 03:11:20,861 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 [2022-07-13 03:11:20,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:20,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:20,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:20,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:20,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:20,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:20,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:20,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:20,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:20,902 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 [2022-07-13 03:11:20,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,903 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) [2022-07-13 03:11:20,904 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 [2022-07-13 03:11:20,905 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 [2022-07-13 03:11:20,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:20,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:20,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:20,911 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 03:11:20,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:20,912 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:11:20,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:20,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:20,928 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-13 03:11:20,928 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:11:20,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:20,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:20,929 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) [2022-07-13 03:11:20,930 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 [2022-07-13 03:11:20,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:20,931 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:20,931 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:20,931 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 [] [2022-07-13 03:11:20,948 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 [2022-07-13 03:11:20,949 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:20,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:20,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:20,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:20,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:20,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:11:20,998 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) [2022-07-13 03:11:21,028 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. [2022-07-13 03:11:21,028 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 [2022-07-13 03:11:21,029 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) [2022-07-13 03:11:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-13 03:11:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-13 03:11:21,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-13 03:11:21,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2022-07-13 03:11:21,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2022-07-13 03:11:21,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:11:21,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2022-07-13 03:11:21,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-13 03:11:21,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-13 03:11:21,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2022-07-13 03:11:21,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:21,033 INFO L369 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2022-07-13 03:11:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2022-07-13 03:11:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-07-13 03:11:21,036 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) [2022-07-13 03:11:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-07-13 03:11:21,037 INFO L392 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-07-13 03:11:21,037 INFO L374 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-07-13 03:11:21,037 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:11:21,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2022-07-13 03:11:21,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-13 03:11:21,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:21,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:21,038 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:21,039 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:21,039 INFO L752 eck$LassoCheckResult]: Stem: 851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 867#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 912#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 917#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 863#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 864#L20-1 assume !(0 == main_~up~0#1); 913#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 910#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 868#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 869#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 879#L17-1 [2022-07-13 03:11:21,039 INFO L754 eck$LassoCheckResult]: Loop: 879#L17-1 assume !(1 == main_~up~0#1); 875#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 876#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 892#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 922#L14 assume !(0 == main_~i~0#1); 881#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 879#L17-1 [2022-07-13 03:11:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1214420765, now seen corresponding path program 1 times [2022-07-13 03:11:21,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:21,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81398391] [2022-07-13 03:11:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81398391] [2022-07-13 03:11:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81398391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:21,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:21,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:11:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478084387] [2022-07-13 03:11:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:21,055 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1719875308, now seen corresponding path program 1 times [2022-07-13 03:11:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061390796] [2022-07-13 03:11:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:21,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:21,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:21,088 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:21,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:21,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:21,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:21,089 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:21,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:21,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:21,089 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-07-13 03:11:21,089 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:21,089 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:21,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,144 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:21,145 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,146 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:21,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:21,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:21,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 03:11:21,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:21,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:21,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:21,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,186 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) [2022-07-13 03:11:21,187 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 [2022-07-13 03:11:21,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:21,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:21,230 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 [2022-07-13 03:11:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,232 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) [2022-07-13 03:11:21,233 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 [2022-07-13 03:11:21,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:21,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:21,364 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:21,368 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 [2022-07-13 03:11:21,368 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:21,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:21,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:21,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:21,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:21,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:21,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:21,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-07-13 03:11:21,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:21,369 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:21,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,400 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 [2022-07-13 03:11:21,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,453 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:21,453 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:21,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,472 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) [2022-07-13 03:11:21,477 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 [2022-07-13 03:11:21,477 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 [2022-07-13 03:11:21,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:21,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:21,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:21,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:21,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:21,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:21,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:21,518 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 [2022-07-13 03:11:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,519 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) [2022-07-13 03:11:21,521 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 [2022-07-13 03:11:21,522 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 [2022-07-13 03:11:21,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:21,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:21,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:21,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:21,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:21,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:21,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:21,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:21,539 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:21,539 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:11:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,540 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:21,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:11:21,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:21,543 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:21,543 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:21,543 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 [] [2022-07-13 03:11:21,560 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 [2022-07-13 03:11:21,561 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:21,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:21,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:21,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:21,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:21,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:11:21,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-13 03:11:21,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 161 states and 226 transitions. Complement of second has 7 states. [2022-07-13 03:11:21,645 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 [2022-07-13 03:11:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-13 03:11:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-13 03:11:21,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-13 03:11:21,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 6 letters. [2022-07-13 03:11:21,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2022-07-13 03:11:21,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:21,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 226 transitions. [2022-07-13 03:11:21,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-13 03:11:21,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 127 states and 177 transitions. [2022-07-13 03:11:21,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-07-13 03:11:21,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-13 03:11:21,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 177 transitions. [2022-07-13 03:11:21,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:21,650 INFO L369 hiAutomatonCegarLoop]: Abstraction has 127 states and 177 transitions. [2022-07-13 03:11:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 177 transitions. [2022-07-13 03:11:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2022-07-13 03:11:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.423728813559322) internal successors, (168), 117 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2022-07-13 03:11:21,655 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 168 transitions. [2022-07-13 03:11:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:11:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:11:21,656 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. 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) [2022-07-13 03:11:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:21,672 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2022-07-13 03:11:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:11:21,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 184 transitions. [2022-07-13 03:11:21,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2022-07-13 03:11:21,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 184 transitions. [2022-07-13 03:11:21,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-13 03:11:21,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-13 03:11:21,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 184 transitions. [2022-07-13 03:11:21,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:21,675 INFO L369 hiAutomatonCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-13 03:11:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 184 transitions. [2022-07-13 03:11:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2022-07-13 03:11:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 117 states have internal predecessors, (156), 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) [2022-07-13 03:11:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2022-07-13 03:11:21,680 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-07-13 03:11:21,680 INFO L374 stractBuchiCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-07-13 03:11:21,680 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:11:21,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 156 transitions. [2022-07-13 03:11:21,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-13 03:11:21,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:21,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:21,681 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:21,681 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:11:21,681 INFO L752 eck$LassoCheckResult]: Stem: 1420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1421#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; 1435#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1475#L14 assume !(0 == main_~i~0#1); 1506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1505#L17-1 assume !(1 == main_~up~0#1); 1504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1501#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 1502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1510#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1495#L17-1 [2022-07-13 03:11:21,681 INFO L754 eck$LassoCheckResult]: Loop: 1495#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1493#L20-1 assume !(0 == main_~up~0#1); 1491#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1488#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1466#L14 assume !(0 == main_~i~0#1); 1467#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1495#L17-1 [2022-07-13 03:11:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:21,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2022-07-13 03:11:21,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:21,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052376957] [2022-07-13 03:11:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052376957] [2022-07-13 03:11:21,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052376957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:21,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257736030] [2022-07-13 03:11:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,698 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) [2022-07-13 03:11:21,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 03:11:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:21,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:11:21,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:21,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:21,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257736030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:21,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:21,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 03:11:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553952230] [2022-07-13 03:11:21,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:21,739 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2022-07-13 03:11:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:21,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313891824] [2022-07-13 03:11:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:21,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:21,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:21,787 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:21,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:21,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:21,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:21,787 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:21,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:21,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:21,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2022-07-13 03:11:21,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:21,788 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:21,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:21,887 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:21,887 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,924 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:21,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:11:21,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:21,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:21,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:21,984 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) [2022-07-13 03:11:21,984 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 [2022-07-13 03:11:21,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:21,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:22,207 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:22,210 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 [2022-07-13 03:11:22,211 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:22,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:22,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:22,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:22,211 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:22,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:22,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:22,211 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:22,211 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2022-07-13 03:11:22,211 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:22,211 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:22,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:22,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:22,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:22,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:22,312 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:22,313 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:22,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:22,314 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) [2022-07-13 03:11:22,315 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 [2022-07-13 03:11:22,316 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 [2022-07-13 03:11:22,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:22,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:22,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:22,325 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 03:11:22,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:22,327 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:11:22,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:22,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:22,331 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:22,331 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:11:22,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:22,332 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) [2022-07-13 03:11:22,333 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 [2022-07-13 03:11:22,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:22,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:22,334 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:22,334 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 [] [2022-07-13 03:11:22,350 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 [2022-07-13 03:11:22,351 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:11:22,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 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) [2022-07-13 03:11:22,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. 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 155 states and 198 transitions. Complement of second has 7 states. [2022-07-13 03:11:22,434 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 [2022-07-13 03:11:22,435 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) [2022-07-13 03:11:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-13 03:11:22,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-13 03:11:22,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:22,435 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:22,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:11:22,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 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) [2022-07-13 03:11:22,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. 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 204 states and 259 transitions. Complement of second has 9 states. [2022-07-13 03:11:22,543 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 [2022-07-13 03:11:22,543 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) [2022-07-13 03:11:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-07-13 03:11:22,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-13 03:11:22,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:22,543 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,576 INFO L152 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 [2022-07-13 03:11:22,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 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) [2022-07-13 03:11:22,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. 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 186 states and 243 transitions. Complement of second has 8 states. [2022-07-13 03:11:22,596 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 [2022-07-13 03:11:22,596 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) [2022-07-13 03:11:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-07-13 03:11:22,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-13 03:11:22,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:22,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 6 letters. [2022-07-13 03:11:22,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:22,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2022-07-13 03:11:22,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:22,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 243 transitions. [2022-07-13 03:11:22,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-13 03:11:22,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 140 states and 182 transitions. [2022-07-13 03:11:22,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-13 03:11:22,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-13 03:11:22,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2022-07-13 03:11:22,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:22,600 INFO L369 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2022-07-13 03:11:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2022-07-13 03:11:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 93. [2022-07-13 03:11:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 92 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2022-07-13 03:11:22,603 INFO L392 hiAutomatonCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-07-13 03:11:22,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:11:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:11:22,604 INFO L87 Difference]: Start difference. First operand 93 states and 125 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) [2022-07-13 03:11:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:22,651 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2022-07-13 03:11:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:11:22,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 489 transitions. [2022-07-13 03:11:22,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2022-07-13 03:11:22,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 366 states and 471 transitions. [2022-07-13 03:11:22,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 03:11:22,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 03:11:22,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 471 transitions. [2022-07-13 03:11:22,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:22,655 INFO L369 hiAutomatonCegarLoop]: Abstraction has 366 states and 471 transitions. [2022-07-13 03:11:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 471 transitions. [2022-07-13 03:11:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 302. [2022-07-13 03:11:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 302 states have (on average 1.2980132450331126) internal successors, (392), 301 states have internal predecessors, (392), 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) [2022-07-13 03:11:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 392 transitions. [2022-07-13 03:11:22,674 INFO L392 hiAutomatonCegarLoop]: Abstraction has 302 states and 392 transitions. [2022-07-13 03:11:22,674 INFO L374 stractBuchiCegarLoop]: Abstraction has 302 states and 392 transitions. [2022-07-13 03:11:22,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:11:22,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 392 transitions. [2022-07-13 03:11:22,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2022-07-13 03:11:22,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:22,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:22,675 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:11:22,676 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:11:22,676 INFO L752 eck$LassoCheckResult]: Stem: 2830#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2831#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; 2846#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3015#L14 assume !(0 == main_~i~0#1); 3013#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3014#L17-1 assume !(1 == main_~up~0#1); 3131#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2842#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2843#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3130#L14 assume !(0 == main_~i~0#1); 3128#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3118#L17-1 assume !(1 == main_~up~0#1); 3068#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2893#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2883#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2876#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2877#L17-1 [2022-07-13 03:11:22,676 INFO L754 eck$LassoCheckResult]: Loop: 2877#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3058#L20-1 assume !(0 == main_~up~0#1); 3056#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2885#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2879#L14 assume !(0 == main_~i~0#1); 2854#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2855#L17-1 assume !(1 == main_~up~0#1); 2836#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2837#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3047#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3046#L14 assume !(0 == main_~i~0#1); 2856#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2852#L17-1 assume !(1 == main_~up~0#1); 2853#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2896#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2890#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2884#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2878#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2877#L17-1 [2022-07-13 03:11:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1579420680, now seen corresponding path program 1 times [2022-07-13 03:11:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:22,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929637984] [2022-07-13 03:11:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929637984] [2022-07-13 03:11:22,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929637984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109812106] [2022-07-13 03:11:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:22,716 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-13 03:11:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109812106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:22,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-13 03:11:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055496894] [2022-07-13 03:11:22,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:22,793 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2022-07-13 03:11:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482087232] [2022-07-13 03:11:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482087232] [2022-07-13 03:11:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482087232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804124118] [2022-07-13 03:11:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:22,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:22,889 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:22,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-13 03:11:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:22,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:11:22,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804124118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:22,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-07-13 03:11:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886818981] [2022-07-13 03:11:22,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:22,978 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:11:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 03:11:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 03:11:22,978 INFO L87 Difference]: Start difference. First operand 302 states and 392 transitions. cyclomatic complexity: 108 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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) [2022-07-13 03:11:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:23,158 INFO L93 Difference]: Finished difference Result 940 states and 1180 transitions. [2022-07-13 03:11:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 03:11:23,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 1180 transitions. [2022-07-13 03:11:23,162 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 270 [2022-07-13 03:11:23,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 906 states and 1143 transitions. [2022-07-13 03:11:23,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2022-07-13 03:11:23,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2022-07-13 03:11:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 906 states and 1143 transitions. [2022-07-13 03:11:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:23,166 INFO L369 hiAutomatonCegarLoop]: Abstraction has 906 states and 1143 transitions. [2022-07-13 03:11:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states and 1143 transitions. [2022-07-13 03:11:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 463. [2022-07-13 03:11:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.285097192224622) internal successors, (595), 462 states have internal predecessors, (595), 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) [2022-07-13 03:11:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 595 transitions. [2022-07-13 03:11:23,172 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 595 transitions. [2022-07-13 03:11:23,172 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 595 transitions. [2022-07-13 03:11:23,173 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:11:23,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 595 transitions. [2022-07-13 03:11:23,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2022-07-13 03:11:23,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:23,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:23,175 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1] [2022-07-13 03:11:23,175 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:23,180 INFO L752 eck$LassoCheckResult]: Stem: 4316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4317#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; 4332#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4531#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4366#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4362#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4363#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4634#L14 assume !(0 == main_~i~0#1); 4631#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4629#L17-1 assume !(1 == main_~up~0#1); 4627#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4625#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4623#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4622#L14 assume !(0 == main_~i~0#1); 4620#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4373#L17-1 assume !(1 == main_~up~0#1); 4618#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4613#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4609#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4602#L17-1 assume !(1 == main_~up~0#1); 4601#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4525#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4594#L14 assume !(0 == main_~i~0#1); 4591#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4471#L17-1 assume !(1 == main_~up~0#1); 4468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4466#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4452#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4464#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4462#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4414#L17-1 [2022-07-13 03:11:23,180 INFO L754 eck$LassoCheckResult]: Loop: 4414#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4460#L20-1 assume !(0 == main_~up~0#1); 4459#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4430#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4423#L14 assume !(0 == main_~i~0#1); 4415#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4382#L17-1 assume !(1 == main_~up~0#1); 4388#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4387#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4375#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4444#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4413#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4414#L17-1 [2022-07-13 03:11:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1344654385, now seen corresponding path program 1 times [2022-07-13 03:11:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983201327] [2022-07-13 03:11:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 03:11:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983201327] [2022-07-13 03:11:23,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983201327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:23,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:23,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:11:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987790270] [2022-07-13 03:11:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:23,223 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash -654021601, now seen corresponding path program 2 times [2022-07-13 03:11:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484991756] [2022-07-13 03:11:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:23,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:11:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:11:23,282 INFO L87 Difference]: Start difference. First operand 463 states and 595 transitions. cyclomatic complexity: 150 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-07-13 03:11:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:23,299 INFO L93 Difference]: Finished difference Result 453 states and 536 transitions. [2022-07-13 03:11:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:11:23,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 536 transitions. [2022-07-13 03:11:23,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2022-07-13 03:11:23,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 439 states and 516 transitions. [2022-07-13 03:11:23,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-07-13 03:11:23,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-07-13 03:11:23,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 516 transitions. [2022-07-13 03:11:23,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:23,304 INFO L369 hiAutomatonCegarLoop]: Abstraction has 439 states and 516 transitions. [2022-07-13 03:11:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 516 transitions. [2022-07-13 03:11:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2022-07-13 03:11:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 421 states have (on average 1.182897862232779) internal successors, (498), 420 states have internal predecessors, (498), 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) [2022-07-13 03:11:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 498 transitions. [2022-07-13 03:11:23,308 INFO L392 hiAutomatonCegarLoop]: Abstraction has 421 states and 498 transitions. [2022-07-13 03:11:23,308 INFO L374 stractBuchiCegarLoop]: Abstraction has 421 states and 498 transitions. [2022-07-13 03:11:23,308 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:11:23,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 498 transitions. [2022-07-13 03:11:23,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2022-07-13 03:11:23,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:23,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:23,311 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1] [2022-07-13 03:11:23,311 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:23,311 INFO L752 eck$LassoCheckResult]: Stem: 5239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5240#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; 5254#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5440#L14 assume !(0 == main_~i~0#1); 5441#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5603#L17-1 assume !(1 == main_~up~0#1); 5602#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5253#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5243#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5244#L14 assume !(0 == main_~i~0#1); 5256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5251#L17-1 assume !(1 == main_~up~0#1); 5247#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5483#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5598#L14 assume !(0 == main_~i~0#1); 5597#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5596#L17-1 assume !(1 == main_~up~0#1); 5595#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5594#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5593#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5592#L14 assume !(0 == main_~i~0#1); 5591#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5590#L17-1 assume !(1 == main_~up~0#1); 5589#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5587#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5585#L14 assume !(0 == main_~i~0#1); 5583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5581#L17-1 assume !(1 == main_~up~0#1); 5579#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5575#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5479#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5494#L14 assume !(0 == main_~i~0#1); 5491#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5489#L17-1 assume !(1 == main_~up~0#1); 5487#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5478#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5473#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5474#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5271#L14-2 [2022-07-13 03:11:23,311 INFO L754 eck$LassoCheckResult]: Loop: 5271#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5272#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5652#L20-1 assume !(0 == main_~up~0#1); 5600#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5558#L14 assume !(0 == main_~i~0#1); 5556#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5554#L17-1 assume !(1 == main_~up~0#1); 5552#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5481#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5476#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5659#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5271#L14-2 [2022-07-13 03:11:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 816551444, now seen corresponding path program 2 times [2022-07-13 03:11:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648274919] [2022-07-13 03:11:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 03:11:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648274919] [2022-07-13 03:11:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648274919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:23,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:11:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215069562] [2022-07-13 03:11:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:23,355 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2022-07-13 03:11:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375138289] [2022-07-13 03:11:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:11:23,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:11:23,408 INFO L87 Difference]: Start difference. First operand 421 states and 498 transitions. cyclomatic complexity: 95 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:23,438 INFO L93 Difference]: Finished difference Result 509 states and 569 transitions. [2022-07-13 03:11:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:11:23,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 569 transitions. [2022-07-13 03:11:23,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 133 [2022-07-13 03:11:23,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 503 states and 563 transitions. [2022-07-13 03:11:23,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2022-07-13 03:11:23,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2022-07-13 03:11:23,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 563 transitions. [2022-07-13 03:11:23,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:23,443 INFO L369 hiAutomatonCegarLoop]: Abstraction has 503 states and 563 transitions. [2022-07-13 03:11:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 563 transitions. [2022-07-13 03:11:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2022-07-13 03:11:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 501 states have (on average 1.1197604790419162) internal successors, (561), 500 states have internal predecessors, (561), 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) [2022-07-13 03:11:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 561 transitions. [2022-07-13 03:11:23,448 INFO L392 hiAutomatonCegarLoop]: Abstraction has 501 states and 561 transitions. [2022-07-13 03:11:23,448 INFO L374 stractBuchiCegarLoop]: Abstraction has 501 states and 561 transitions. [2022-07-13 03:11:23,448 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:11:23,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 561 transitions. [2022-07-13 03:11:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2022-07-13 03:11:23,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:23,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:23,450 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2022-07-13 03:11:23,451 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:23,451 INFO L752 eck$LassoCheckResult]: Stem: 6178#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6179#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; 6192#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6310#L14 assume !(0 == main_~i~0#1); 6307#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6308#L17-1 assume !(1 == main_~up~0#1); 6529#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6526#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6524#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6521#L14 assume !(0 == main_~i~0#1); 6519#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6517#L17-1 assume !(1 == main_~up~0#1); 6515#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6512#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6510#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6508#L14 assume !(0 == main_~i~0#1); 6506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6504#L17-1 assume !(1 == main_~up~0#1); 6502#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6499#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6497#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6493#L14 assume !(0 == main_~i~0#1); 6491#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6489#L17-1 assume !(1 == main_~up~0#1); 6487#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6481#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6477#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6471#L14 assume !(0 == main_~i~0#1); 6467#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6463#L17-1 assume !(1 == main_~up~0#1); 6459#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6454#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6413#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6447#L14 assume !(0 == main_~i~0#1); 6444#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6440#L17-1 assume !(1 == main_~up~0#1); 6436#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6411#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6412#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6210#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6209#L14-2 [2022-07-13 03:11:23,451 INFO L754 eck$LassoCheckResult]: Loop: 6209#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6207#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6208#L20-1 assume !(0 == main_~up~0#1); 6431#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6427#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6424#L14 assume !(0 == main_~i~0#1); 6422#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6420#L17-1 assume !(1 == main_~up~0#1); 6418#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6416#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6408#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6409#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6209#L14-2 [2022-07-13 03:11:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1673713296, now seen corresponding path program 3 times [2022-07-13 03:11:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543746061] [2022-07-13 03:11:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:23,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:23,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543746061] [2022-07-13 03:11:23,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543746061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:23,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289982058] [2022-07-13 03:11:23,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:11:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:23,513 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:23,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-13 03:11:23,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 03:11:23,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:23,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:11:23,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 03:11:23,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 03:11:23,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289982058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:23,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:23,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-07-13 03:11:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605595501] [2022-07-13 03:11:23,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:23,674 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2022-07-13 03:11:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:23,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630189818] [2022-07-13 03:11:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:23,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 03:11:23,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-07-13 03:11:23,773 INFO L87 Difference]: Start difference. First operand 501 states and 561 transitions. cyclomatic complexity: 82 Second operand has 18 states, 17 states have (on average 5.529411764705882) internal successors, (94), 18 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) [2022-07-13 03:11:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:24,224 INFO L93 Difference]: Finished difference Result 2479 states and 2633 transitions. [2022-07-13 03:11:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-13 03:11:24,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2479 states and 2633 transitions. [2022-07-13 03:11:24,233 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 632 [2022-07-13 03:11:24,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2479 states to 2337 states and 2481 transitions. [2022-07-13 03:11:24,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 815 [2022-07-13 03:11:24,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2022-07-13 03:11:24,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2337 states and 2481 transitions. [2022-07-13 03:11:24,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:24,240 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2337 states and 2481 transitions. [2022-07-13 03:11:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states and 2481 transitions. [2022-07-13 03:11:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1841. [2022-07-13 03:11:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1841 states have (on average 1.0700706137968496) internal successors, (1970), 1840 states have internal predecessors, (1970), 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) [2022-07-13 03:11:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 1970 transitions. [2022-07-13 03:11:24,256 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2022-07-13 03:11:24,256 INFO L374 stractBuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2022-07-13 03:11:24,256 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 03:11:24,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1841 states and 1970 transitions. [2022-07-13 03:11:24,260 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 390 [2022-07-13 03:11:24,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:24,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:24,262 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2022-07-13 03:11:24,262 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:24,262 INFO L752 eck$LassoCheckResult]: Stem: 9487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9488#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; 9501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9640#L14 assume !(0 == main_~i~0#1); 9638#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9639#L17-1 assume !(1 == main_~up~0#1); 9986#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9985#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9984#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9983#L14 assume !(0 == main_~i~0#1); 9982#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9981#L17-1 assume !(1 == main_~up~0#1); 9980#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9978#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9977#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9976#L14 assume !(0 == main_~i~0#1); 9975#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9974#L17-1 assume !(1 == main_~up~0#1); 9973#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9971#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9970#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9969#L14 assume !(0 == main_~i~0#1); 9968#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9967#L17-1 assume !(1 == main_~up~0#1); 9966#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9964#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9963#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9962#L14 assume !(0 == main_~i~0#1); 9961#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9960#L17-1 assume !(1 == main_~up~0#1); 9959#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9957#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9956#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9955#L14 assume !(0 == main_~i~0#1); 9954#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9953#L17-1 assume !(1 == main_~up~0#1); 9952#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9950#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9949#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9948#L14 assume !(0 == main_~i~0#1); 9947#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9946#L17-1 assume !(1 == main_~up~0#1); 9945#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9943#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9942#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9941#L14 assume !(0 == main_~i~0#1); 9940#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9939#L17-1 assume !(1 == main_~up~0#1); 9938#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9936#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9935#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9934#L14 assume !(0 == main_~i~0#1); 9933#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9932#L17-1 assume !(1 == main_~up~0#1); 9931#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9929#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9928#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9927#L14 assume !(0 == main_~i~0#1); 9926#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9925#L17-1 assume !(1 == main_~up~0#1); 9924#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9922#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9921#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9920#L14 assume !(0 == main_~i~0#1); 9919#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9918#L17-1 assume !(1 == main_~up~0#1); 9917#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9915#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9914#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9913#L14 assume !(0 == main_~i~0#1); 9912#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9911#L17-1 assume !(1 == main_~up~0#1); 9910#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9909#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9665#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9712#L14 assume !(0 == main_~i~0#1); 9699#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9695#L17-1 assume !(1 == main_~up~0#1); 9670#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9663#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9521#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 9518#L14-2 [2022-07-13 03:11:24,262 INFO L754 eck$LassoCheckResult]: Loop: 9518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9516#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 9517#L20-1 assume !(0 == main_~up~0#1); 9677#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9676#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9674#L14 assume !(0 == main_~i~0#1); 9673#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9672#L17-1 assume !(1 == main_~up~0#1); 9671#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9668#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9658#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9659#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 9518#L14-2 [2022-07-13 03:11:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -214808025, now seen corresponding path program 4 times [2022-07-13 03:11:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:24,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388170304] [2022-07-13 03:11:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:24,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388170304] [2022-07-13 03:11:24,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388170304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:24,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915205846] [2022-07-13 03:11:24,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:11:24,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:24,419 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:24,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-13 03:11:24,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:11:24,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:24,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 03:11:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:24,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:24,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915205846] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:24,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:24,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-07-13 03:11:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272387553] [2022-07-13 03:11:24,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:24,723 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2022-07-13 03:11:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:24,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526026481] [2022-07-13 03:11:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:24,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:24,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 03:11:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=360, Unknown=0, NotChecked=0, Total=600 [2022-07-13 03:11:24,764 INFO L87 Difference]: Start difference. First operand 1841 states and 1970 transitions. cyclomatic complexity: 170 Second operand has 25 states, 24 states have (on average 5.458333333333333) internal successors, (131), 25 states have internal predecessors, (131), 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) [2022-07-13 03:11:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:25,588 INFO L93 Difference]: Finished difference Result 5887 states and 6200 transitions. [2022-07-13 03:11:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-07-13 03:11:25,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5887 states and 6200 transitions. [2022-07-13 03:11:25,607 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1451 [2022-07-13 03:11:25,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5887 states to 5733 states and 6032 transitions. [2022-07-13 03:11:25,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2218 [2022-07-13 03:11:25,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2218 [2022-07-13 03:11:25,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5733 states and 6032 transitions. [2022-07-13 03:11:25,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:25,627 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5733 states and 6032 transitions. [2022-07-13 03:11:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states and 6032 transitions. [2022-07-13 03:11:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 2137. [2022-07-13 03:11:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2137 states have (on average 1.0608329433785681) internal successors, (2267), 2136 states have internal predecessors, (2267), 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) [2022-07-13 03:11:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2267 transitions. [2022-07-13 03:11:25,688 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2137 states and 2267 transitions. [2022-07-13 03:11:25,688 INFO L374 stractBuchiCegarLoop]: Abstraction has 2137 states and 2267 transitions. [2022-07-13 03:11:25,688 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-13 03:11:25,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2137 states and 2267 transitions. [2022-07-13 03:11:25,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 488 [2022-07-13 03:11:25,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:25,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:25,712 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2022-07-13 03:11:25,712 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:11:25,712 INFO L752 eck$LassoCheckResult]: Stem: 17845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17846#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; 17859#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18107#L14 assume !(0 == main_~i~0#1); 18105#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 18106#L17-1 assume !(1 == main_~up~0#1); 18919#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18918#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18917#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18916#L14 assume !(0 == main_~i~0#1); 18915#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18914#L17-1 assume !(1 == main_~up~0#1); 18913#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18911#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18910#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18909#L14 assume !(0 == main_~i~0#1); 18908#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18907#L17-1 assume !(1 == main_~up~0#1); 18906#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18904#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18903#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18902#L14 assume !(0 == main_~i~0#1); 18901#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18900#L17-1 assume !(1 == main_~up~0#1); 18899#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18897#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18896#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18895#L14 assume !(0 == main_~i~0#1); 18894#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18893#L17-1 assume !(1 == main_~up~0#1); 18892#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18890#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18889#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18888#L14 assume !(0 == main_~i~0#1); 18887#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18886#L17-1 assume !(1 == main_~up~0#1); 18885#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18883#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18882#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18881#L14 assume !(0 == main_~i~0#1); 18880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18879#L17-1 assume !(1 == main_~up~0#1); 18878#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18876#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18875#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18874#L14 assume !(0 == main_~i~0#1); 18873#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18872#L17-1 assume !(1 == main_~up~0#1); 18871#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18869#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18868#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18867#L14 assume !(0 == main_~i~0#1); 18866#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18865#L17-1 assume !(1 == main_~up~0#1); 18864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18863#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18862#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18860#L14 assume !(0 == main_~i~0#1); 18858#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18856#L17-1 assume !(1 == main_~up~0#1); 18854#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18852#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18850#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18848#L14 assume !(0 == main_~i~0#1); 18846#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18844#L17-1 assume !(1 == main_~up~0#1); 18842#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18840#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18838#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18836#L14 assume !(0 == main_~i~0#1); 18834#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18832#L17-1 assume !(1 == main_~up~0#1); 18830#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18828#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18826#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18824#L14 assume !(0 == main_~i~0#1); 18822#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18820#L17-1 assume !(1 == main_~up~0#1); 18818#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18816#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18814#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18812#L14 assume !(0 == main_~i~0#1); 18810#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18808#L17-1 assume !(1 == main_~up~0#1); 18806#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18804#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18802#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18800#L14 assume !(0 == main_~i~0#1); 18798#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18796#L17-1 assume !(1 == main_~up~0#1); 18794#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18790#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18788#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18786#L14 assume !(0 == main_~i~0#1); 18784#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18782#L17-1 assume !(1 == main_~up~0#1); 18780#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18776#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18774#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18772#L14 assume !(0 == main_~i~0#1); 18770#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18768#L17-1 assume !(1 == main_~up~0#1); 18766#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18762#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18760#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18758#L14 assume !(0 == main_~i~0#1); 18756#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18754#L17-1 assume !(1 == main_~up~0#1); 18752#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18750#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18739#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18737#L14 assume !(0 == main_~i~0#1); 18735#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18733#L17-1 assume !(1 == main_~up~0#1); 18730#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18731#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18551#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18642#L14 assume !(0 == main_~i~0#1); 18563#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18561#L17-1 assume !(1 == main_~up~0#1); 18559#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18549#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18590#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17889#L14-2 [2022-07-13 03:11:25,713 INFO L754 eck$LassoCheckResult]: Loop: 17889#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18586#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 18584#L20-1 assume !(0 == main_~up~0#1); 18581#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18576#L14 assume !(0 == main_~i~0#1); 18574#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 18572#L17-1 assume !(1 == main_~up~0#1); 18570#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18567#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18547#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18564#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17889#L14-2 [2022-07-13 03:11:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1715097854, now seen corresponding path program 5 times [2022-07-13 03:11:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:25,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264594366] [2022-07-13 03:11:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 6 times [2022-07-13 03:11:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:25,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615863546] [2022-07-13 03:11:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -989936736, now seen corresponding path program 1 times [2022-07-13 03:11:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:25,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274395542] [2022-07-13 03:11:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:25,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:26,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:11:26 BoogieIcfgContainer [2022-07-13 03:11:26,603 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:11:26,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:11:26,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:11:26,603 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:11:26,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:18" (3/4) ... [2022-07-13 03:11:26,605 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:11:26,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:11:26,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:11:26,657 INFO L158 Benchmark]: Toolchain (without parser) took 8261.46ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 68.2MB in the beginning and 57.9MB in the end (delta: 10.3MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,657 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:11:26,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.53ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 77.8MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 100.7MB. Free memory was 77.8MB in the beginning and 76.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:11:26,658 INFO L158 Benchmark]: Boogie Preprocessor took 10.13ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.7MB in the end (delta: 742.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,658 INFO L158 Benchmark]: RCFGBuilder took 139.17ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 67.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,658 INFO L158 Benchmark]: BuchiAutomizer took 7833.79ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 67.0MB in the beginning and 62.1MB in the end (delta: 4.9MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,658 INFO L158 Benchmark]: Witness Printer took 53.75ms. Allocated memory is still 176.2MB. Free memory was 62.1MB in the beginning and 57.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:11:26,659 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.14ms. Allocated memory is still 79.7MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.53ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 77.8MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 100.7MB. Free memory was 77.8MB in the beginning and 76.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.13ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.7MB in the end (delta: 742.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 139.17ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 67.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7833.79ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 67.0MB in the beginning and 62.1MB in the end (delta: 4.9MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 53.75ms. Allocated memory is still 176.2MB. Free memory was 62.1MB in the beginning and 57.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (12 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 -1 * i + range and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 12 modules have a trivial ranking function, the largest among these consists of 25 locations. The remainder module has 2137 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 15 iterations. TraceHistogramMax:21. Analysis of lassos took 5.1s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 4733 StatesRemovedByMinimization, 14 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, 726 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1262 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 199 mSDtfsCounter, 1262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc2 concLT0 SILN4 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax143 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf96 smp65 dnf131 smp96 tf106 neg91 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1332d5e1=0, up=1, range=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: 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 [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 FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] 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! [2022-07-13 03:11:26,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-07-13 03:11:26,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:27,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:27,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:27,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)