./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-19 17:18:08,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:18:08,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:18:08,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:18:08,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:18:08,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:18:08,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:18:08,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:18:08,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:18:08,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:18:08,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:18:08,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:18:08,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:18:08,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:18:08,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:18:08,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:18:08,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:18:08,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:18:08,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:18:08,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:18:08,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:18:08,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:18:08,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:18:08,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:18:08,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:18:08,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:18:08,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:18:08,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:18:08,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:18:08,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:18:08,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:18:08,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:18:08,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:18:08,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:18:08,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:18:08,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:18:08,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:18:08,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:18:08,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:18:08,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:18:08,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:18:08,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:18:08,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:18:08,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:18:08,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:18:08,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:18:08,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:18:08,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:18:08,977 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:18:08,977 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:18:08,977 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:18:08,977 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:18:08,978 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:18:08,978 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:18:08,978 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:18:08,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:18:08,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:18:08,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:18:08,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:18:08,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:18:08,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:18:08,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:18:08,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:18:08,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:18:08,981 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:18:08,982 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 [2021-12-19 17:18:09,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:18:09,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:18:09,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:18:09,168 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:18:09,169 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:18:09,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2021-12-19 17:18:09,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99612c39/d0d8ea4953f24c03ad98e9fc34e8ce97/FLAGbd3c68766 [2021-12-19 17:18:09,517 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:18:09,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2021-12-19 17:18:09,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99612c39/d0d8ea4953f24c03ad98e9fc34e8ce97/FLAGbd3c68766 [2021-12-19 17:18:09,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99612c39/d0d8ea4953f24c03ad98e9fc34e8ce97 [2021-12-19 17:18:09,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:18:09,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:18:09,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:18:09,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:18:09,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:18:09,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ba5a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09, skipping insertion in model container [2021-12-19 17:18:09,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:18:09,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:18:09,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:18:09,639 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:18:09,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:18:09,668 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:18:09,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09 WrapperNode [2021-12-19 17:18:09,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:18:09,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:18:09,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:18:09,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:18:09,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,694 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2021-12-19 17:18:09,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:18:09,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:18:09,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:18:09,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:18:09,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:18:09,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:18:09,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:18:09,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:18:09,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (1/1) ... [2021-12-19 17:18:09,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:09,727 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) [2021-12-19 17:18:09,743 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 [2021-12-19 17:18:09,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:18:09,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:18:09,800 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:18:09,801 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:18:09,861 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:18:09,865 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:18:09,866 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-19 17:18:09,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:09 BoogieIcfgContainer [2021-12-19 17:18:09,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:18:09,868 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:18:09,868 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:18:09,871 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:18:09,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:18:09,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:18:09" (1/3) ... [2021-12-19 17:18:09,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27dad65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:18:09, skipping insertion in model container [2021-12-19 17:18:09,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:18:09,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:09" (2/3) ... [2021-12-19 17:18:09,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27dad65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:18:09, skipping insertion in model container [2021-12-19 17:18:09,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:18:09,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:09" (3/3) ... [2021-12-19 17:18:09,874 INFO L388 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2021-12-19 17:18:09,901 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:18:09,901 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:18:09,901 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:18:09,901 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:18:09,901 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:18:09,901 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:18:09,901 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:18:09,901 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:18:09,914 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) [2021-12-19 17:18:09,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:18:09,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:09,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:09,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:18:09,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:09,935 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:18:09,935 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) [2021-12-19 17:18:09,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:18:09,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:09,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:09,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:18:09,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:09,942 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#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; 5#L26-1true [2021-12-19 17:18:09,942 INFO L793 eck$LassoCheckResult]: Loop: 5#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 12#L14true assume !(0 == main_~i~0#1); 13#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 10#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 11#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5#L26-1true [2021-12-19 17:18:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-19 17:18:09,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:09,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877323213] [2021-12-19 17:18:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:09,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,040 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2021-12-19 17:18:10,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875245213] [2021-12-19 17:18:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:10,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875245213] [2021-12-19 17:18:10,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875245213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:10,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:10,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:18:10,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797341775] [2021-12-19 17:18:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:10,160 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:18:10,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:18:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:18:10,228 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) [2021-12-19 17:18:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:10,258 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2021-12-19 17:18:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:18:10,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2021-12-19 17:18:10,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-19 17:18:10,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2021-12-19 17:18:10,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-19 17:18:10,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-19 17:18:10,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2021-12-19 17:18:10,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:18:10,267 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2021-12-19 17:18:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2021-12-19 17:18:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-19 17:18:10,283 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) [2021-12-19 17:18:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2021-12-19 17:18:10,284 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2021-12-19 17:18:10,284 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2021-12-19 17:18:10,284 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:18:10,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2021-12-19 17:18:10,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-19 17:18:10,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:10,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:10,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:18:10,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:10,288 INFO L791 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 [2021-12-19 17:18:10,289 INFO L793 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 [2021-12-19 17:18:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-19 17:18:10,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445456019] [2021-12-19 17:18:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2021-12-19 17:18:10,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512551189] [2021-12-19 17:18:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:10,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512551189] [2021-12-19 17:18:10,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512551189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:10,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:10,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:18:10,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855913279] [2021-12-19 17:18:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:10,335 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:18:10,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:10,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:18:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 17:18:10,338 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) [2021-12-19 17:18:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:10,374 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2021-12-19 17:18:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:18:10,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2021-12-19 17:18:10,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2021-12-19 17:18:10,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2021-12-19 17:18:10,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-19 17:18:10,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-19 17:18:10,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2021-12-19 17:18:10,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:18:10,379 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2021-12-19 17:18:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2021-12-19 17:18:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-19 17:18:10,382 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) [2021-12-19 17:18:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2021-12-19 17:18:10,383 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2021-12-19 17:18:10,383 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2021-12-19 17:18:10,383 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:18:10,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2021-12-19 17:18:10,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2021-12-19 17:18:10,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:10,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:10,384 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:18:10,384 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:10,384 INFO L791 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 [2021-12-19 17:18:10,384 INFO L793 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 [2021-12-19 17:18:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-19 17:18:10,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778441115] [2021-12-19 17:18:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,389 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2021-12-19 17:18:10,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409777913] [2021-12-19 17:18:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:10,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409777913] [2021-12-19 17:18:10,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409777913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:10,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:10,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:18:10,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058488925] [2021-12-19 17:18:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:10,411 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:18:10,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:18:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:18:10,412 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) [2021-12-19 17:18:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:10,428 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2021-12-19 17:18:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:18:10,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2021-12-19 17:18:10,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2021-12-19 17:18:10,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2021-12-19 17:18:10,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-19 17:18:10,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-19 17:18:10,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2021-12-19 17:18:10,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:18:10,433 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 58 transitions. [2021-12-19 17:18:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2021-12-19 17:18:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-19 17:18:10,437 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) [2021-12-19 17:18:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2021-12-19 17:18:10,438 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-19 17:18:10,438 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-19 17:18:10,438 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:18:10,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2021-12-19 17:18:10,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2021-12-19 17:18:10,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:10,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:10,439 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:18:10,439 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:10,440 INFO L791 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 [2021-12-19 17:18:10,451 INFO L793 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 [2021-12-19 17:18:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-19 17:18:10,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246937727] [2021-12-19 17:18:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,456 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2021-12-19 17:18:10,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370364990] [2021-12-19 17:18:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,464 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2021-12-19 17:18:10,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:10,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674527118] [2021-12-19 17:18:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:10,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:10,472 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:10,543 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:10,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:10,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:10,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:10,545 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:18:10,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,546 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:10,546 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:10,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2021-12-19 17:18:10,548 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:10,548 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:10,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:10,648 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:18:10,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,658 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) [2021-12-19 17:18:10,659 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 [2021-12-19 17:18:10,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:10,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:10,679 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:10,679 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: [] [2021-12-19 17:18:10,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 17:18:10,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,707 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) [2021-12-19 17:18:10,708 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 [2021-12-19 17:18:10,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:10,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:10,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:10,721 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: [] [2021-12-19 17:18:10,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 17:18:10,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,736 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) [2021-12-19 17:18:10,737 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 [2021-12-19 17:18:10,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:10,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:10,770 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 [2021-12-19 17:18:10,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,771 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) [2021-12-19 17:18:10,772 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 [2021-12-19 17:18:10,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:18:10,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:10,805 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:18:10,810 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 [2021-12-19 17:18:10,810 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:10,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:10,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:10,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:10,810 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:18:10,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:10,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:10,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2021-12-19 17:18:10,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:10,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:10,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:10,904 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:10,907 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:18:10,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,909 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) [2021-12-19 17:18:10,910 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 [2021-12-19 17:18:10,924 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 [2021-12-19 17:18:10,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:10,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:10,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:10,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:10,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:18:10,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:18:10,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:10,971 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 [2021-12-19 17:18:10,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:10,972 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) [2021-12-19 17:18:10,973 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 [2021-12-19 17:18:10,974 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 [2021-12-19 17:18:10,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:10,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:10,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:10,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:10,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:10,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:18:10,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:10,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:18:11,001 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-19 17:18:11,001 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:18:11,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,003 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) [2021-12-19 17:18:11,004 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 [2021-12-19 17:18:11,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:18:11,006 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:18:11,006 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:18:11,007 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 [] [2021-12-19 17:18:11,022 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 [2021-12-19 17:18:11,024 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:18:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:11,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:11,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:11,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:18:11,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:11,138 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 [2021-12-19 17:18:11,138 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) [2021-12-19 17:18:11,188 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. [2021-12-19 17:18:11,188 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 [2021-12-19 17:18:11,189 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) [2021-12-19 17:18:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-12-19 17:18:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-19 17:18:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2021-12-19 17:18:11,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:11,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2021-12-19 17:18:11,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:11,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2021-12-19 17:18:11,202 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2021-12-19 17:18:11,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2021-12-19 17:18:11,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-12-19 17:18:11,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-19 17:18:11,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2021-12-19 17:18:11,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:11,206 INFO L681 BuchiCegarLoop]: Abstraction has 100 states and 152 transitions. [2021-12-19 17:18:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2021-12-19 17:18:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2021-12-19 17:18:11,212 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) [2021-12-19 17:18:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2021-12-19 17:18:11,215 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2021-12-19 17:18:11,215 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2021-12-19 17:18:11,215 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:18:11,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2021-12-19 17:18:11,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2021-12-19 17:18:11,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:11,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:11,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 17:18:11,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:11,221 INFO L791 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 [2021-12-19 17:18:11,221 INFO L793 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 [2021-12-19 17:18:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2021-12-19 17:18:11,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248596294] [2021-12-19 17:18:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2021-12-19 17:18:11,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077655135] [2021-12-19 17:18:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2021-12-19 17:18:11,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076084123] [2021-12-19 17:18:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:11,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076084123] [2021-12-19 17:18:11,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076084123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:11,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:11,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:18:11,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299576265] [2021-12-19 17:18:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:11,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:18:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:18:11,272 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) [2021-12-19 17:18:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:11,280 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2021-12-19 17:18:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:18:11,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2021-12-19 17:18:11,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2021-12-19 17:18:11,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2021-12-19 17:18:11,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-19 17:18:11,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-19 17:18:11,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2021-12-19 17:18:11,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:11,283 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 102 transitions. [2021-12-19 17:18:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2021-12-19 17:18:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2021-12-19 17:18:11,285 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) [2021-12-19 17:18:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2021-12-19 17:18:11,286 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2021-12-19 17:18:11,286 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2021-12-19 17:18:11,286 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:18:11,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2021-12-19 17:18:11,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2021-12-19 17:18:11,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:11,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:11,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:18:11,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:11,286 INFO L791 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 [2021-12-19 17:18:11,286 INFO L793 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 [2021-12-19 17:18:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2021-12-19 17:18:11,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250153727] [2021-12-19 17:18:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,292 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2021-12-19 17:18:11,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401872532] [2021-12-19 17:18:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2021-12-19 17:18:11,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42233893] [2021-12-19 17:18:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:11,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42233893] [2021-12-19 17:18:11,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42233893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:11,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:11,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:18:11,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797582441] [2021-12-19 17:18:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:11,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:18:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:18:11,350 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) [2021-12-19 17:18:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:11,357 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2021-12-19 17:18:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:18:11,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2021-12-19 17:18:11,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-19 17:18:11,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2021-12-19 17:18:11,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-19 17:18:11,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-19 17:18:11,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2021-12-19 17:18:11,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:11,359 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 64 transitions. [2021-12-19 17:18:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2021-12-19 17:18:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2021-12-19 17:18:11,361 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) [2021-12-19 17:18:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2021-12-19 17:18:11,361 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2021-12-19 17:18:11,361 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2021-12-19 17:18:11,361 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:18:11,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2021-12-19 17:18:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-19 17:18:11,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:11,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:11,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:18:11,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:11,362 INFO L791 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 [2021-12-19 17:18:11,362 INFO L793 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 [2021-12-19 17:18:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2021-12-19 17:18:11,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276457241] [2021-12-19 17:18:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2021-12-19 17:18:11,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536068986] [2021-12-19 17:18:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,379 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2021-12-19 17:18:11,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:11,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818127094] [2021-12-19 17:18:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:11,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:11,388 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:11,433 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:11,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:11,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:11,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:11,433 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:18:11,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:11,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:11,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2021-12-19 17:18:11,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:11,434 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:11,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:11,552 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:18:11,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,556 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) [2021-12-19 17:18:11,563 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 [2021-12-19 17:18:11,569 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 [2021-12-19 17:18:11,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:11,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:11,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:11,582 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: [] [2021-12-19 17:18:11,596 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 [2021-12-19 17:18:11,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,598 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) [2021-12-19 17:18:11,598 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 [2021-12-19 17:18:11,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:11,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:11,623 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:11,623 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: [] [2021-12-19 17:18:11,638 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 [2021-12-19 17:18:11,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,639 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) [2021-12-19 17:18:11,640 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 [2021-12-19 17:18:11,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:11,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:11,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:11,651 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: [] [2021-12-19 17:18:11,666 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 [2021-12-19 17:18:11,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,667 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) [2021-12-19 17:18:11,667 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 [2021-12-19 17:18:11,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:11,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:11,702 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 [2021-12-19 17:18:11,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,703 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) [2021-12-19 17:18:11,704 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 [2021-12-19 17:18:11,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:18:11,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:11,849 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:18:11,853 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 [2021-12-19 17:18:11,853 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:11,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:11,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:11,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:11,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:18:11,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:11,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:11,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2021-12-19 17:18:11,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:11,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:11,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:11,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:11,951 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:18:11,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,952 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) [2021-12-19 17:18:11,952 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 [2021-12-19 17:18:11,953 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 [2021-12-19 17:18:11,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:11,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:11,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:11,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:11,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:18:11,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:18:11,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:11,984 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 [2021-12-19 17:18:11,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:11,990 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) [2021-12-19 17:18:11,991 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 [2021-12-19 17:18:11,992 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 [2021-12-19 17:18:11,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:12,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:18:12,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:18:12,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:12,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-19 17:18:12,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,019 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) [2021-12-19 17:18:12,022 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 [2021-12-19 17:18:12,023 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 [2021-12-19 17:18:12,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:12,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:12,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:12,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:12,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:12,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:18:12,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:12,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:12,051 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 [2021-12-19 17:18:12,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,053 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) [2021-12-19 17:18:12,055 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 [2021-12-19 17:18:12,055 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 [2021-12-19 17:18:12,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:12,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:12,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:12,061 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 17:18:12,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:12,063 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 17:18:12,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:12,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:18:12,074 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:18:12,074 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:18:12,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,075 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) [2021-12-19 17:18:12,075 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 [2021-12-19 17:18:12,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:18:12,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:18:12,077 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:18:12,077 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 [] [2021-12-19 17:18:12,092 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 [2021-12-19 17:18:12,092 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:18:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:12,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:18:12,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,175 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 [2021-12-19 17:18:12,176 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) [2021-12-19 17:18:12,202 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. [2021-12-19 17:18:12,202 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 [2021-12-19 17:18:12,203 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) [2021-12-19 17:18:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2021-12-19 17:18:12,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-19 17:18:12,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 17:18:12,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2021-12-19 17:18:12,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2021-12-19 17:18:12,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-19 17:18:12,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2021-12-19 17:18:12,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-19 17:18:12,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-19 17:18:12,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2021-12-19 17:18:12,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:12,206 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 107 transitions. [2021-12-19 17:18:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2021-12-19 17:18:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2021-12-19 17:18:12,211 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) [2021-12-19 17:18:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2021-12-19 17:18:12,211 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-12-19 17:18:12,211 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-12-19 17:18:12,211 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 17:18:12,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2021-12-19 17:18:12,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-19 17:18:12,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:12,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:12,212 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:12,212 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:12,212 INFO L791 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 [2021-12-19 17:18:12,212 INFO L793 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 [2021-12-19 17:18:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1214420765, now seen corresponding path program 1 times [2021-12-19 17:18:12,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446430322] [2021-12-19 17:18:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:12,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:12,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446430322] [2021-12-19 17:18:12,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446430322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:12,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:12,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:18:12,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164483842] [2021-12-19 17:18:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:12,231 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1719875308, now seen corresponding path program 1 times [2021-12-19 17:18:12,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:12,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199906768] [2021-12-19 17:18:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:12,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:12,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:12,236 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:12,269 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:12,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:12,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:12,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:12,269 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:18:12,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:12,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:12,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2021-12-19 17:18:12,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:12,269 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,340 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:12,340 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:18:12,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,341 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) [2021-12-19 17:18:12,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:12,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:12,355 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 [2021-12-19 17:18:12,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:12,363 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: [] [2021-12-19 17:18:12,379 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 [2021-12-19 17:18:12,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,380 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) [2021-12-19 17:18:12,380 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 [2021-12-19 17:18:12,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:12,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:12,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-19 17:18:12,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,417 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) [2021-12-19 17:18:12,417 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 [2021-12-19 17:18:12,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:18:12,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:12,525 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:18:12,542 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 [2021-12-19 17:18:12,542 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:12,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:12,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:12,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:12,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:18:12,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:12,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:12,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2021-12-19 17:18:12,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:12,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:12,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,546 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 [2021-12-19 17:18:12,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,613 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:12,613 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:18:12,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,624 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) [2021-12-19 17:18:12,624 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 [2021-12-19 17:18:12,625 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 [2021-12-19 17:18:12,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:12,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:12,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:12,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:12,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:18:12,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:18:12,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:12,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-19 17:18:12,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,660 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) [2021-12-19 17:18:12,660 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 [2021-12-19 17:18:12,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 [2021-12-19 17:18:12,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:12,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:12,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:12,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:12,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:12,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:18:12,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:12,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:18:12,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 17:18:12,677 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:18:12,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,678 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) [2021-12-19 17:18:12,679 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 [2021-12-19 17:18:12,680 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:18:12,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:18:12,681 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:18:12,681 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 [] [2021-12-19 17:18:12,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-19 17:18:12,697 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:18:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:12,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:18:12,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,769 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 [2021-12-19 17:18:12,769 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) [2021-12-19 17:18:12,792 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. [2021-12-19 17:18:12,793 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 [2021-12-19 17:18:12,793 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) [2021-12-19 17:18:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-19 17:18:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 17:18:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 6 letters. [2021-12-19 17:18:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2021-12-19 17:18:12,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:12,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 226 transitions. [2021-12-19 17:18:12,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2021-12-19 17:18:12,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 127 states and 177 transitions. [2021-12-19 17:18:12,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-12-19 17:18:12,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-19 17:18:12,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 177 transitions. [2021-12-19 17:18:12,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:12,797 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 177 transitions. [2021-12-19 17:18:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 177 transitions. [2021-12-19 17:18:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2021-12-19 17:18:12,800 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) [2021-12-19 17:18:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2021-12-19 17:18:12,801 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 168 transitions. [2021-12-19 17:18:12,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:18:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 17:18:12,802 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) [2021-12-19 17:18:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:12,818 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2021-12-19 17:18:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:18:12,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 184 transitions. [2021-12-19 17:18:12,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2021-12-19 17:18:12,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 184 transitions. [2021-12-19 17:18:12,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-19 17:18:12,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-19 17:18:12,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 184 transitions. [2021-12-19 17:18:12,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:12,820 INFO L681 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2021-12-19 17:18:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 184 transitions. [2021-12-19 17:18:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2021-12-19 17:18:12,825 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) [2021-12-19 17:18:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2021-12-19 17:18:12,829 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 156 transitions. [2021-12-19 17:18:12,829 INFO L587 BuchiCegarLoop]: Abstraction has 118 states and 156 transitions. [2021-12-19 17:18:12,829 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 17:18:12,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 156 transitions. [2021-12-19 17:18:12,830 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2021-12-19 17:18:12,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:12,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:12,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:12,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:18:12,831 INFO L791 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 [2021-12-19 17:18:12,831 INFO L793 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 [2021-12-19 17:18:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2021-12-19 17:18:12,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:12,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210249602] [2021-12-19 17:18:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:12,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:12,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210249602] [2021-12-19 17:18:12,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210249602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:12,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726484955] [2021-12-19 17:18:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:12,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:12,863 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) [2021-12-19 17:18:12,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-19 17:18:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:12,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 17:18:12,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:12,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726484955] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:12,928 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:12,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-19 17:18:12,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184775118] [2021-12-19 17:18:12,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:12,929 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2021-12-19 17:18:12,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:12,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986410647] [2021-12-19 17:18:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:12,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:12,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:12,934 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:12,979 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:12,979 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:12,979 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:12,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:12,980 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:18:12,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:12,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:12,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:12,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2021-12-19 17:18:12,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:12,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:12,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:12,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:13,067 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:13,067 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:18:13,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,107 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) [2021-12-19 17:18:13,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:13,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:13,114 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 [2021-12-19 17:18:13,115 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:18:13,115 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: [] [2021-12-19 17:18:13,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-19 17:18:13,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,132 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) [2021-12-19 17:18:13,132 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 [2021-12-19 17:18:13,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:18:13,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:13,166 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 [2021-12-19 17:18:13,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,167 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) [2021-12-19 17:18:13,168 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 [2021-12-19 17:18:13,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:18:13,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:18:13,327 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:18:13,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-19 17:18:13,330 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:18:13,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:18:13,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:18:13,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:18:13,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:18:13,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:18:13,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:18:13,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2021-12-19 17:18:13,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:18:13,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:18:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:13,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:13,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:13,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:18:13,416 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:18:13,416 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:18:13,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,417 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) [2021-12-19 17:18:13,418 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 [2021-12-19 17:18:13,420 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 [2021-12-19 17:18:13,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:13,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:13,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:13,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:18:13,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:13,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:18:13,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:13,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:18:13,458 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 [2021-12-19 17:18:13,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,460 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:18:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 17:18:13,461 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 [2021-12-19 17:18:13,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:18:13,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:18:13,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:18:13,468 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 17:18:13,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:18:13,469 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 17:18:13,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:18:13,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:18:13,483 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:18:13,483 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:18:13,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:18:13,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,484 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:18:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 17:18:13,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:18:13,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:18:13,486 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:18:13,486 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 [] [2021-12-19 17:18:13,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-19 17:18:13,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:18:13,528 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 [2021-12-19 17:18:13,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-19 17:18:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,595 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 [2021-12-19 17:18:13,595 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) [2021-12-19 17:18:13,620 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. [2021-12-19 17:18:13,620 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 [2021-12-19 17:18:13,621 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) [2021-12-19 17:18:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-19 17:18:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 17:18:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:13,622 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:18:13,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,674 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 [2021-12-19 17:18:13,674 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) [2021-12-19 17:18:13,706 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. [2021-12-19 17:18:13,707 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 [2021-12-19 17:18:13,707 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) [2021-12-19 17:18:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2021-12-19 17:18:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 17:18:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:13,708 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:18:13,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,755 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 [2021-12-19 17:18:13,755 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) [2021-12-19 17:18:13,779 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. [2021-12-19 17:18:13,780 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 [2021-12-19 17:18:13,780 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) [2021-12-19 17:18:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2021-12-19 17:18:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-19 17:18:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 6 letters. [2021-12-19 17:18:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2021-12-19 17:18:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:18:13,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 243 transitions. [2021-12-19 17:18:13,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-19 17:18:13,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 140 states and 182 transitions. [2021-12-19 17:18:13,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-12-19 17:18:13,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-19 17:18:13,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2021-12-19 17:18:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:13,783 INFO L681 BuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2021-12-19 17:18:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2021-12-19 17:18:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 93. [2021-12-19 17:18:13,785 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) [2021-12-19 17:18:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2021-12-19 17:18:13,785 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2021-12-19 17:18:13,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 17:18:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 17:18:13,786 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) [2021-12-19 17:18:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:13,846 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2021-12-19 17:18:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 17:18:13,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 489 transitions. [2021-12-19 17:18:13,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2021-12-19 17:18:13,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 366 states and 471 transitions. [2021-12-19 17:18:13,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2021-12-19 17:18:13,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2021-12-19 17:18:13,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 471 transitions. [2021-12-19 17:18:13,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:13,851 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 471 transitions. [2021-12-19 17:18:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 471 transitions. [2021-12-19 17:18:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 302. [2021-12-19 17:18:13,855 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) [2021-12-19 17:18:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 392 transitions. [2021-12-19 17:18:13,855 INFO L704 BuchiCegarLoop]: Abstraction has 302 states and 392 transitions. [2021-12-19 17:18:13,855 INFO L587 BuchiCegarLoop]: Abstraction has 302 states and 392 transitions. [2021-12-19 17:18:13,855 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 17:18:13,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 392 transitions. [2021-12-19 17:18:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2021-12-19 17:18:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:13,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:13,857 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-19 17:18:13,857 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-19 17:18:13,857 INFO L791 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 [2021-12-19 17:18:13,857 INFO L793 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 [2021-12-19 17:18:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1579420680, now seen corresponding path program 1 times [2021-12-19 17:18:13,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:13,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056483295] [2021-12-19 17:18:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:13,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:13,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056483295] [2021-12-19 17:18:13,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056483295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:13,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387277961] [2021-12-19 17:18:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:13,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:13,894 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) [2021-12-19 17:18:13,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-19 17:18:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:13,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:18:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:13,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387277961] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:13,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:13,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-19 17:18:13,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635180820] [2021-12-19 17:18:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:13,974 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2021-12-19 17:18:13,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054222508] [2021-12-19 17:18:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:13,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:14,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054222508] [2021-12-19 17:18:14,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054222508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801815981] [2021-12-19 17:18:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:14,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:14,057 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) [2021-12-19 17:18:14,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-19 17:18:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:14,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:18:14,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:14,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:14,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801815981] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:14,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:14,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2021-12-19 17:18:14,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255572423] [2021-12-19 17:18:14,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:14,194 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:18:14,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:14,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 17:18:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 17:18:14,195 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) [2021-12-19 17:18:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:14,353 INFO L93 Difference]: Finished difference Result 940 states and 1180 transitions. [2021-12-19 17:18:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 17:18:14,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 1180 transitions. [2021-12-19 17:18:14,357 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 270 [2021-12-19 17:18:14,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 906 states and 1143 transitions. [2021-12-19 17:18:14,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2021-12-19 17:18:14,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2021-12-19 17:18:14,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 906 states and 1143 transitions. [2021-12-19 17:18:14,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:14,361 INFO L681 BuchiCegarLoop]: Abstraction has 906 states and 1143 transitions. [2021-12-19 17:18:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states and 1143 transitions. [2021-12-19 17:18:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 463. [2021-12-19 17:18:14,366 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) [2021-12-19 17:18:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 595 transitions. [2021-12-19 17:18:14,367 INFO L704 BuchiCegarLoop]: Abstraction has 463 states and 595 transitions. [2021-12-19 17:18:14,367 INFO L587 BuchiCegarLoop]: Abstraction has 463 states and 595 transitions. [2021-12-19 17:18:14,367 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 17:18:14,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 595 transitions. [2021-12-19 17:18:14,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2021-12-19 17:18:14,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:14,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:14,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1] [2021-12-19 17:18:14,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:14,369 INFO L791 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 [2021-12-19 17:18:14,369 INFO L793 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 [2021-12-19 17:18:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1344654385, now seen corresponding path program 1 times [2021-12-19 17:18:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290131092] [2021-12-19 17:18:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-19 17:18:14,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290131092] [2021-12-19 17:18:14,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290131092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:14,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:14,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:18:14,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198227069] [2021-12-19 17:18:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:14,387 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -654021601, now seen corresponding path program 2 times [2021-12-19 17:18:14,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209176734] [2021-12-19 17:18:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:14,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:18:14,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 17:18:14,432 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) [2021-12-19 17:18:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:14,447 INFO L93 Difference]: Finished difference Result 453 states and 536 transitions. [2021-12-19 17:18:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:18:14,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 536 transitions. [2021-12-19 17:18:14,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2021-12-19 17:18:14,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 439 states and 516 transitions. [2021-12-19 17:18:14,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-19 17:18:14,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-19 17:18:14,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 516 transitions. [2021-12-19 17:18:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:14,452 INFO L681 BuchiCegarLoop]: Abstraction has 439 states and 516 transitions. [2021-12-19 17:18:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 516 transitions. [2021-12-19 17:18:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2021-12-19 17:18:14,456 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) [2021-12-19 17:18:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 498 transitions. [2021-12-19 17:18:14,457 INFO L704 BuchiCegarLoop]: Abstraction has 421 states and 498 transitions. [2021-12-19 17:18:14,457 INFO L587 BuchiCegarLoop]: Abstraction has 421 states and 498 transitions. [2021-12-19 17:18:14,457 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 17:18:14,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 498 transitions. [2021-12-19 17:18:14,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2021-12-19 17:18:14,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:14,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:14,459 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1] [2021-12-19 17:18:14,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:14,459 INFO L791 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 [2021-12-19 17:18:14,459 INFO L793 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 [2021-12-19 17:18:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 816551444, now seen corresponding path program 2 times [2021-12-19 17:18:14,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309449147] [2021-12-19 17:18:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 17:18:14,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:14,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309449147] [2021-12-19 17:18:14,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309449147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:14,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:14,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 17:18:14,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067982217] [2021-12-19 17:18:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:14,494 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2021-12-19 17:18:14,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907572402] [2021-12-19 17:18:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:14,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 17:18:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-19 17:18:14,545 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) [2021-12-19 17:18:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:14,574 INFO L93 Difference]: Finished difference Result 509 states and 569 transitions. [2021-12-19 17:18:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:18:14,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 569 transitions. [2021-12-19 17:18:14,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 133 [2021-12-19 17:18:14,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 503 states and 563 transitions. [2021-12-19 17:18:14,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2021-12-19 17:18:14,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2021-12-19 17:18:14,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 563 transitions. [2021-12-19 17:18:14,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:14,579 INFO L681 BuchiCegarLoop]: Abstraction has 503 states and 563 transitions. [2021-12-19 17:18:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 563 transitions. [2021-12-19 17:18:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2021-12-19 17:18:14,584 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) [2021-12-19 17:18:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 561 transitions. [2021-12-19 17:18:14,585 INFO L704 BuchiCegarLoop]: Abstraction has 501 states and 561 transitions. [2021-12-19 17:18:14,586 INFO L587 BuchiCegarLoop]: Abstraction has 501 states and 561 transitions. [2021-12-19 17:18:14,586 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 17:18:14,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 561 transitions. [2021-12-19 17:18:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2021-12-19 17:18:14,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:14,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:14,588 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2021-12-19 17:18:14,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:14,588 INFO L791 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 [2021-12-19 17:18:14,588 INFO L793 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 [2021-12-19 17:18:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1673713296, now seen corresponding path program 3 times [2021-12-19 17:18:14,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974526526] [2021-12-19 17:18:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:14,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:14,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974526526] [2021-12-19 17:18:14,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974526526] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:14,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385845259] [2021-12-19 17:18:14,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:18:14,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:14,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:14,653 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:18:14,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-19 17:18:14,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 17:18:14,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:18:14,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:18:14,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:18:14,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:18:14,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385845259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:14,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:14,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2021-12-19 17:18:14,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799055777] [2021-12-19 17:18:14,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:14,875 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2021-12-19 17:18:14,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:14,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164738573] [2021-12-19 17:18:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:14,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:14,888 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:14,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 17:18:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-12-19 17:18:14,933 INFO L87 Difference]: Start difference. First operand 501 states and 561 transitions. cyclomatic complexity: 82 Second operand has 20 states, 19 states have (on average 5.368421052631579) internal successors, (102), 20 states have internal predecessors, (102), 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) [2021-12-19 17:18:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:15,436 INFO L93 Difference]: Finished difference Result 2196 states and 2399 transitions. [2021-12-19 17:18:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-19 17:18:15,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2196 states and 2399 transitions. [2021-12-19 17:18:15,446 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 348 [2021-12-19 17:18:15,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2196 states to 2116 states and 2317 transitions. [2021-12-19 17:18:15,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2021-12-19 17:18:15,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2021-12-19 17:18:15,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2116 states and 2317 transitions. [2021-12-19 17:18:15,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:15,452 INFO L681 BuchiCegarLoop]: Abstraction has 2116 states and 2317 transitions. [2021-12-19 17:18:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states and 2317 transitions. [2021-12-19 17:18:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1477. [2021-12-19 17:18:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1477 states have (on average 1.10832769126608) internal successors, (1637), 1476 states have internal predecessors, (1637), 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) [2021-12-19 17:18:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1637 transitions. [2021-12-19 17:18:15,482 INFO L704 BuchiCegarLoop]: Abstraction has 1477 states and 1637 transitions. [2021-12-19 17:18:15,482 INFO L587 BuchiCegarLoop]: Abstraction has 1477 states and 1637 transitions. [2021-12-19 17:18:15,482 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 17:18:15,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1477 states and 1637 transitions. [2021-12-19 17:18:15,486 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 254 [2021-12-19 17:18:15,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:15,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:15,487 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 7, 1, 1, 1, 1] [2021-12-19 17:18:15,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 8, 8, 3, 3, 1, 1, 1] [2021-12-19 17:18:15,487 INFO L791 eck$LassoCheckResult]: Stem: 9214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9215#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; 9228#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9483#L14 assume !(0 == main_~i~0#1); 9480#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9481#L17-1 assume !(1 == main_~up~0#1); 9915#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9914#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9913#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9912#L14 assume !(0 == main_~i~0#1); 9911#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9910#L17-1 assume !(1 == main_~up~0#1); 9909#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9907#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9908#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10454#L14 assume !(0 == main_~i~0#1); 10453#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10452#L17-1 assume !(1 == main_~up~0#1); 10451#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10450#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10449#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10448#L14 assume !(0 == main_~i~0#1); 10447#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10446#L17-1 assume !(1 == main_~up~0#1); 10445#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10444#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10443#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10442#L14 assume !(0 == main_~i~0#1); 10441#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10440#L17-1 assume !(1 == main_~up~0#1); 10439#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10438#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10437#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10436#L14 assume !(0 == main_~i~0#1); 10435#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10434#L17-1 assume !(1 == main_~up~0#1); 10433#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10432#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10431#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10430#L14 assume !(0 == main_~i~0#1); 10429#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10428#L17-1 assume !(1 == main_~up~0#1); 10427#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10426#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10335#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10409#L14 assume !(0 == main_~i~0#1); 10341#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10339#L17-1 assume !(1 == main_~up~0#1); 10337#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10334#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10329#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10320#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 10318#L14-2 [2021-12-19 17:18:15,487 INFO L793 eck$LassoCheckResult]: Loop: 10318#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10316#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10315#L20-1 assume !(0 == main_~up~0#1); 10313#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 10312#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10310#L14 assume !(0 == main_~i~0#1); 10308#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10306#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10304#L20-1 assume !(0 == main_~up~0#1); 10302#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10300#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10297#L14 assume !(0 == main_~i~0#1); 10298#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10375#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10331#L20-1 assume !(0 == main_~up~0#1); 10328#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10311#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10309#L14 assume !(0 == main_~i~0#1); 10307#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 10305#L17-1 assume !(1 == main_~up~0#1); 10303#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10301#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10299#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10296#L14 assume !(0 == main_~i~0#1); 10294#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10292#L17-1 assume !(1 == main_~up~0#1); 10290#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10287#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10288#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10373#L14 assume !(0 == main_~i~0#1); 10372#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10371#L17-1 assume !(1 == main_~up~0#1); 10370#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10369#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10368#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10367#L14 assume !(0 == main_~i~0#1); 10366#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10365#L17-1 assume !(1 == main_~up~0#1); 10364#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10363#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10362#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10361#L14 assume !(0 == main_~i~0#1); 10360#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10359#L17-1 assume !(1 == main_~up~0#1); 10358#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10357#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10356#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10355#L14 assume !(0 == main_~i~0#1); 10354#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10353#L17-1 assume !(1 == main_~up~0#1); 10352#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10351#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10350#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10349#L14 assume !(0 == main_~i~0#1); 10348#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10347#L17-1 assume !(1 == main_~up~0#1); 10346#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10345#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10344#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10342#L14 assume !(0 == main_~i~0#1); 10340#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 10338#L17-1 assume !(1 == main_~up~0#1); 10336#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10332#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 10333#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10343#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 10318#L14-2 [2021-12-19 17:18:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1098643648, now seen corresponding path program 2 times [2021-12-19 17:18:15,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:15,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713498031] [2021-12-19 17:18:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:15,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:15,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713498031] [2021-12-19 17:18:15,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713498031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739979297] [2021-12-19 17:18:15,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:18:15,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:15,545 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:18:15,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-19 17:18:15,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:18:15,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:18:15,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:18:15,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:15,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:15,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739979297] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:15,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:15,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2021-12-19 17:18:15,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202061825] [2021-12-19 17:18:15,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:15,789 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 747447588, now seen corresponding path program 1 times [2021-12-19 17:18:15,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094518958] [2021-12-19 17:18:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:15,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-19 17:18:15,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:15,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094518958] [2021-12-19 17:18:15,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094518958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:18:15,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:18:15,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 17:18:15,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752823777] [2021-12-19 17:18:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:18:15,833 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:18:15,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-19 17:18:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2021-12-19 17:18:15,834 INFO L87 Difference]: Start difference. First operand 1477 states and 1637 transitions. cyclomatic complexity: 236 Second operand has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 22 states have internal predecessors, (103), 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) [2021-12-19 17:18:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:16,341 INFO L93 Difference]: Finished difference Result 6055 states and 6372 transitions. [2021-12-19 17:18:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-12-19 17:18:16,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6055 states and 6372 transitions. [2021-12-19 17:18:16,362 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 526 [2021-12-19 17:18:16,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6055 states to 5707 states and 6014 transitions. [2021-12-19 17:18:16,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1941 [2021-12-19 17:18:16,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1941 [2021-12-19 17:18:16,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5707 states and 6014 transitions. [2021-12-19 17:18:16,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:16,378 INFO L681 BuchiCegarLoop]: Abstraction has 5707 states and 6014 transitions. [2021-12-19 17:18:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states and 6014 transitions. [2021-12-19 17:18:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 4791. [2021-12-19 17:18:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4791 states, 4791 states have (on average 1.0594865372573576) internal successors, (5076), 4790 states have internal predecessors, (5076), 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) [2021-12-19 17:18:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4791 states to 4791 states and 5076 transitions. [2021-12-19 17:18:16,435 INFO L704 BuchiCegarLoop]: Abstraction has 4791 states and 5076 transitions. [2021-12-19 17:18:16,436 INFO L587 BuchiCegarLoop]: Abstraction has 4791 states and 5076 transitions. [2021-12-19 17:18:16,436 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 17:18:16,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4791 states and 5076 transitions. [2021-12-19 17:18:16,447 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 496 [2021-12-19 17:18:16,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:16,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:16,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2021-12-19 17:18:16,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:16,448 INFO L791 eck$LassoCheckResult]: Stem: 17152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17153#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; 17168#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17344#L14 assume !(0 == main_~i~0#1); 17342#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 17343#L17-1 assume !(1 == main_~up~0#1); 17758#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17757#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 17756#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17755#L14 assume !(0 == main_~i~0#1); 17754#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17753#L17-1 assume !(1 == main_~up~0#1); 17752#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17750#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17749#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17748#L14 assume !(0 == main_~i~0#1); 17747#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17746#L17-1 assume !(1 == main_~up~0#1); 17745#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17743#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17742#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17741#L14 assume !(0 == main_~i~0#1); 17740#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17739#L17-1 assume !(1 == main_~up~0#1); 17738#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17736#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17735#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17734#L14 assume !(0 == main_~i~0#1); 17733#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17732#L17-1 assume !(1 == main_~up~0#1); 17731#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17729#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17728#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17727#L14 assume !(0 == main_~i~0#1); 17726#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17725#L17-1 assume !(1 == main_~up~0#1); 17724#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17722#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17721#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17720#L14 assume !(0 == main_~i~0#1); 17719#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17718#L17-1 assume !(1 == main_~up~0#1); 17717#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17715#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17714#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17713#L14 assume !(0 == main_~i~0#1); 17712#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17711#L17-1 assume !(1 == main_~up~0#1); 17710#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17708#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17707#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17706#L14 assume !(0 == main_~i~0#1); 17705#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17704#L17-1 assume !(1 == main_~up~0#1); 17703#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17701#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17700#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17699#L14 assume !(0 == main_~i~0#1); 17698#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17697#L17-1 assume !(1 == main_~up~0#1); 17696#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17694#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17693#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17692#L14 assume !(0 == main_~i~0#1); 17691#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17690#L17-1 assume !(1 == main_~up~0#1); 17689#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17687#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17686#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17685#L14 assume !(0 == main_~i~0#1); 17684#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17683#L17-1 assume !(1 == main_~up~0#1); 17682#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17680#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17679#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17678#L14 assume !(0 == main_~i~0#1); 17677#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17676#L17-1 assume !(1 == main_~up~0#1); 17675#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17673#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17672#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17671#L14 assume !(0 == main_~i~0#1); 17670#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17669#L17-1 assume !(1 == main_~up~0#1); 17668#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17666#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17665#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17664#L14 assume !(0 == main_~i~0#1); 17663#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17662#L17-1 assume !(1 == main_~up~0#1); 17661#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17659#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17658#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17657#L14 assume !(0 == main_~i~0#1); 17656#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17655#L17-1 assume !(1 == main_~up~0#1); 17654#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17652#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17651#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17650#L14 assume !(0 == main_~i~0#1); 17649#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17648#L17-1 assume !(1 == main_~up~0#1); 17647#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17646#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17402#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17643#L14 assume !(0 == main_~i~0#1); 17412#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17410#L17-1 assume !(1 == main_~up~0#1); 17408#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17400#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 17401#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17427#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17190#L14-2 [2021-12-19 17:18:16,450 INFO L793 eck$LassoCheckResult]: Loop: 17190#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 17425#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 17423#L20-1 assume !(0 == main_~up~0#1); 17422#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 17421#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17419#L14 assume !(0 == main_~i~0#1); 17418#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 17417#L17-1 assume !(1 == main_~up~0#1); 17416#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 17415#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 17398#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17414#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17190#L14-2 [2021-12-19 17:18:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2080301220, now seen corresponding path program 4 times [2021-12-19 17:18:16,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479600417] [2021-12-19 17:18:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:16,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:18:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:16,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:18:16,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479600417] [2021-12-19 17:18:16,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479600417] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:18:16,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839186331] [2021-12-19 17:18:16,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:18:16,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:18:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:18:16,660 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:18:16,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-19 17:18:16,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:18:16,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:18:16,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:18:16,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:18:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:16,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:18:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:18:17,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839186331] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:18:17,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:18:17,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2021-12-19 17:18:17,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119527663] [2021-12-19 17:18:17,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:18:17,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:18:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2021-12-19 17:18:17,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:17,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696570770] [2021-12-19 17:18:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:17,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:17,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:17,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:17,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:18:17,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 17:18:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=360, Unknown=0, NotChecked=0, Total=600 [2021-12-19 17:18:17,167 INFO L87 Difference]: Start difference. First operand 4791 states and 5076 transitions. cyclomatic complexity: 382 Second operand has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 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) [2021-12-19 17:18:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:18:18,065 INFO L93 Difference]: Finished difference Result 14060 states and 14657 transitions. [2021-12-19 17:18:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-12-19 17:18:18,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14060 states and 14657 transitions. [2021-12-19 17:18:18,102 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 1894 [2021-12-19 17:18:18,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14060 states to 13976 states and 14569 transitions. [2021-12-19 17:18:18,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7237 [2021-12-19 17:18:18,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7237 [2021-12-19 17:18:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13976 states and 14569 transitions. [2021-12-19 17:18:18,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:18:18,166 INFO L681 BuchiCegarLoop]: Abstraction has 13976 states and 14569 transitions. [2021-12-19 17:18:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13976 states and 14569 transitions. [2021-12-19 17:18:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13976 to 9099. [2021-12-19 17:18:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9099 states, 9099 states have (on average 1.0450598966919442) internal successors, (9509), 9098 states have internal predecessors, (9509), 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) [2021-12-19 17:18:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9099 states to 9099 states and 9509 transitions. [2021-12-19 17:18:18,298 INFO L704 BuchiCegarLoop]: Abstraction has 9099 states and 9509 transitions. [2021-12-19 17:18:18,298 INFO L587 BuchiCegarLoop]: Abstraction has 9099 states and 9509 transitions. [2021-12-19 17:18:18,298 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-19 17:18:18,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9099 states and 9509 transitions. [2021-12-19 17:18:18,312 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 1366 [2021-12-19 17:18:18,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:18:18,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:18:18,316 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2021-12-19 17:18:18,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:18:18,316 INFO L791 eck$LassoCheckResult]: Stem: 36815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36816#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; 36829#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 36989#L14 assume !(0 == main_~i~0#1); 36987#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 36988#L17-1 assume !(1 == main_~up~0#1); 38864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 38863#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 38862#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 38861#L14 assume !(0 == main_~i~0#1); 38860#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 38859#L17-1 assume !(1 == main_~up~0#1); 38858#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 38856#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 38855#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 38854#L14 assume !(0 == main_~i~0#1); 38853#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 38852#L17-1 assume !(1 == main_~up~0#1); 38851#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 38849#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 38848#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 38847#L14 assume !(0 == main_~i~0#1); 38846#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 38845#L17-1 assume !(1 == main_~up~0#1); 38844#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 38842#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 38841#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 38840#L14 assume !(0 == main_~i~0#1); 38839#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 38838#L17-1 assume !(1 == main_~up~0#1); 38837#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 38835#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 38836#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39267#L14 assume !(0 == main_~i~0#1); 39266#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39265#L17-1 assume !(1 == main_~up~0#1); 39264#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39262#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39261#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39260#L14 assume !(0 == main_~i~0#1); 39259#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39258#L17-1 assume !(1 == main_~up~0#1); 39257#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39255#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39254#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39253#L14 assume !(0 == main_~i~0#1); 39252#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39251#L17-1 assume !(1 == main_~up~0#1); 39250#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39247#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39246#L14 assume !(0 == main_~i~0#1); 39245#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39244#L17-1 assume !(1 == main_~up~0#1); 39243#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39241#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39240#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39239#L14 assume !(0 == main_~i~0#1); 39238#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39237#L17-1 assume !(1 == main_~up~0#1); 39236#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39234#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39233#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39232#L14 assume !(0 == main_~i~0#1); 39231#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39230#L17-1 assume !(1 == main_~up~0#1); 39229#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39227#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39226#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39225#L14 assume !(0 == main_~i~0#1); 39224#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39223#L17-1 assume !(1 == main_~up~0#1); 39222#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39220#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39219#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39218#L14 assume !(0 == main_~i~0#1); 39217#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39216#L17-1 assume !(1 == main_~up~0#1); 39215#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39213#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39212#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39211#L14 assume !(0 == main_~i~0#1); 39210#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39209#L17-1 assume !(1 == main_~up~0#1); 39208#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39206#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39205#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39204#L14 assume !(0 == main_~i~0#1); 39203#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39202#L17-1 assume !(1 == main_~up~0#1); 39201#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39199#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39198#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39197#L14 assume !(0 == main_~i~0#1); 39196#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39195#L17-1 assume !(1 == main_~up~0#1); 39194#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39192#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39191#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39190#L14 assume !(0 == main_~i~0#1); 39189#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39188#L17-1 assume !(1 == main_~up~0#1); 39187#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39185#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39184#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39183#L14 assume !(0 == main_~i~0#1); 39182#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39181#L17-1 assume !(1 == main_~up~0#1); 39180#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39178#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 39177#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 39176#L14 assume !(0 == main_~i~0#1); 39175#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 39174#L17-1 assume !(1 == main_~up~0#1); 39173#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 39172#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 37957#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 38001#L14 assume !(0 == main_~i~0#1); 37969#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 37967#L17-1 assume !(1 == main_~up~0#1); 37965#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 37955#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 37956#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 37984#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 37212#L14-2 [2021-12-19 17:18:18,316 INFO L793 eck$LassoCheckResult]: Loop: 37212#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 37982#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37980#L20-1 assume !(0 == main_~up~0#1); 37979#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 37978#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 37976#L14 assume !(0 == main_~i~0#1); 37975#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 37974#L17-1 assume !(1 == main_~up~0#1); 37973#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 37972#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 37953#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 37971#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 37212#L14-2 [2021-12-19 17:18:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1715097854, now seen corresponding path program 5 times [2021-12-19 17:18:18,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:18,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719932270] [2021-12-19 17:18:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:18,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 6 times [2021-12-19 17:18:18,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:18,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273167121] [2021-12-19 17:18:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:18,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:18:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -989936736, now seen corresponding path program 1 times [2021-12-19 17:18:18,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:18:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536248527] [2021-12-19 17:18:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:18:18,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:18:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:18:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:18:18,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:18:19,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 05:18:19 BoogieIcfgContainer [2021-12-19 17:18:19,239 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 17:18:19,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 17:18:19,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 17:18:19,239 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 17:18:19,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:09" (3/4) ... [2021-12-19 17:18:19,241 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-19 17:18:19,272 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-19 17:18:19,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 17:18:19,273 INFO L158 Benchmark]: Toolchain (without parser) took 9740.96ms. Allocated memory was 90.2MB in the beginning and 226.5MB in the end (delta: 136.3MB). Free memory was 53.0MB in the beginning and 137.5MB in the end (delta: -84.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,273 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory was 69.3MB in the beginning and 69.3MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:18:19,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.12ms. Allocated memory is still 90.2MB. Free memory was 52.8MB in the beginning and 67.8MB in the end (delta: -15.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.90ms. Allocated memory is still 90.2MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:18:19,273 INFO L158 Benchmark]: Boogie Preprocessor took 9.44ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 65.4MB in the end (delta: 903.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,274 INFO L158 Benchmark]: RCFGBuilder took 161.74ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 57.1MB in the end (delta: 8.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,274 INFO L158 Benchmark]: BuchiAutomizer took 9371.00ms. Allocated memory was 90.2MB in the beginning and 226.5MB in the end (delta: 136.3MB). Free memory was 57.0MB in the beginning and 141.7MB in the end (delta: -84.8MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,274 INFO L158 Benchmark]: Witness Printer took 33.22ms. Allocated memory is still 226.5MB. Free memory was 141.7MB in the beginning and 137.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-19 17:18:19,275 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.15ms. Allocated memory is still 90.2MB. Free memory was 69.3MB in the beginning and 69.3MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.12ms. Allocated memory is still 90.2MB. Free memory was 52.8MB in the beginning and 67.8MB in the end (delta: -15.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.90ms. Allocated memory is still 90.2MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 9.44ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 65.4MB in the end (delta: 903.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 161.74ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 57.1MB in the end (delta: 8.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 9371.00ms. Allocated memory was 90.2MB in the beginning and 226.5MB in the end (delta: 136.3MB). Free memory was 57.0MB in the beginning and 141.7MB in the end (delta: -84.8MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 33.22ms. Allocated memory is still 226.5MB. Free memory was 141.7MB in the beginning and 137.5MB 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 17 terminating modules (13 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function range + -1 * i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 13 modules have a trivial ranking function, the largest among these consists of 25 locations. The remainder module has 9099 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 16 iterations. TraceHistogramMax:21. Analysis of lassos took 5.6s. Construction of modules took 0.7s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 14. Automata minimization 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 7073 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 9099 states and ocurred in iteration 15. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1539 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 209 mSDtfsCounter, 1539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc2 concLT0 SILN4 SILU0 SILI2 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: 47ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@15e39765=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! [2021-12-19 17:18:19,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-19 17:18:19,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-12-19 17:18:19,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-12-19 17:18:19,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-12-19 17:18:20,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-12-19 17:18:20,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-19 17:18:20,520 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)