./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/NO_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:30:47,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:30:47,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:30:47,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:30:47,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:30:47,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:30:47,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:30:47,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:30:47,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:30:47,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:30:47,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:30:47,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:30:47,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:30:47,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:30:47,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:30:47,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:30:47,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:30:47,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:30:47,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:30:47,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:30:47,616 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:30:47,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:30:47,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:30:47,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:30:47,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:30:47,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:30:47,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:30:47,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:30:47,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:30:47,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:30:47,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:30:47,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:30:47,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:30:47,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:30:47,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:30:47,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:30:47,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:30:47,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:30:47,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:30:47,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:30:47,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:30:47,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:30:47,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:30:47,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:30:47,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:30:47,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:30:47,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:30:47,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:30:47,685 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:30:47,685 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:30:47,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:30:47,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:30:47,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:30:47,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:30:47,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:30:47,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:30:47,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:30:47,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:30:47,687 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:30:47,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:30:47,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:30:47,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:30:47,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:30:47,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:30:47,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:30:47,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:30:47,690 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2022-07-22 01:30:48,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:30:48,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:30:48,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:30:48,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:30:48,031 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:30:48,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2022-07-22 01:30:48,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0c82ab6/8bad9d89f46e4192a949fe4f1662c939/FLAGa4fd924b3 [2022-07-22 01:30:48,515 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:30:48,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2022-07-22 01:30:48,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0c82ab6/8bad9d89f46e4192a949fe4f1662c939/FLAGa4fd924b3 [2022-07-22 01:30:48,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0c82ab6/8bad9d89f46e4192a949fe4f1662c939 [2022-07-22 01:30:48,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:30:48,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:30:48,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:30:48,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:30:48,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:30:48,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7719aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48, skipping insertion in model container [2022-07-22 01:30:48,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:30:48,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:30:48,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:30:48,674 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:30:48,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:30:48,709 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:30:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48 WrapperNode [2022-07-22 01:30:48,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:30:48,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:30:48,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:30:48,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:30:48,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,758 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2022-07-22 01:30:48,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:30:48,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:30:48,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:30:48,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:30:48,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:30:48,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:30:48,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:30:48,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:30:48,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (1/1) ... [2022-07-22 01:30:48,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:48,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:48,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:48,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:30:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:30:48,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:30:48,895 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:30:48,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:30:48,966 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:30:48,972 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:30:48,972 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:30:48,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:30:48 BoogieIcfgContainer [2022-07-22 01:30:48,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:30:48,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:30:48,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:30:48,977 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:30:48,977 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:30:48,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:30:48" (1/3) ... [2022-07-22 01:30:48,978 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676df913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:30:48, skipping insertion in model container [2022-07-22 01:30:48,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:30:48,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:30:48" (2/3) ... [2022-07-22 01:30:48,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676df913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:30:48, skipping insertion in model container [2022-07-22 01:30:48,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:30:48,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:30:48" (3/3) ... [2022-07-22 01:30:48,980 INFO L354 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2022-07-22 01:30:49,024 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:30:49,024 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:30:49,024 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:30:49,024 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:30:49,024 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:30:49,025 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:30:49,025 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:30:49,025 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:30:49,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:49,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:49,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:49,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:49,049 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:30:49,049 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:49,049 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:30:49,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:49,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:49,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:49,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:49,051 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:30:49,052 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:49,057 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 3#L10-2true [2022-07-22 01:30:49,057 INFO L754 eck$LassoCheckResult]: Loop: 3#L10-2true assume !!(main_~i~0#1 < 100); 5#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 3#L10-2true [2022-07-22 01:30:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:30:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:49,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526706384] [2022-07-22 01:30:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:49,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:49,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-07-22 01:30:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571504245] [2022-07-22 01:30:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:49,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:49,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-07-22 01:30:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:49,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484082053] [2022-07-22 01:30:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:49,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484082053] [2022-07-22 01:30:49,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484082053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:30:49,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:30:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:30:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092638484] [2022-07-22 01:30:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:30:49,360 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:49,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:49,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:49,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:49,376 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:30:49,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:49,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:49,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2022-07-22 01:30:49,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:49,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:49,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:49,511 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:30:49,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:49,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:49,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:30:49,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:30:49,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:30:49,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 01:30:49,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:49,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:49,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:30:49,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:30:49,607 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:30:49,627 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 [2022-07-22 01:30:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:30:49,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:49,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:49,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:49,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 01:30:49,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:30:49,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:49,703 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:30:49,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:49,722 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:49,722 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:49,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:49,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:49,722 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:30:49,722 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,722 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:49,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:49,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2022-07-22 01:30:49,723 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:49,723 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:49,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:49,780 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:49,784 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:30:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 01:30:49,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:49,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:49,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:49,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:49,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:49,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:30:49,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:30:49,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:30:49,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:49,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 01:30:49,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:49,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:49,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:49,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:49,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:49,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:30:49,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:30:49,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:30:49,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:49,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 01:30:49,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 [2022-07-22 01:30:49,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:49,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:30:49,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:49,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:49,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:49,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:30:49,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:30:49,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:30:49,938 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:30:49,938 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:30:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:49,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:49,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:30:49,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:30:49,943 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:30:49,943 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:30:49,944 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-22 01:30:49,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:49,965 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:30:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:50,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,035 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:50,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:50,068 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 01:30:50,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 24 states and 31 transitions. Complement of second has 6 states. [2022-07-22 01:30:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-22 01:30:50,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 01:30:50,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 01:30:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 01:30:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-07-22 01:30:50,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-07-22 01:30:50,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-22 01:30:50,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-22 01:30:50,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-07-22 01:30:50,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:50,144 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-22 01:30:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-07-22 01:30:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-22 01:30:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-07-22 01:30:50,165 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-22 01:30:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:30:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:30:50,168 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:50,177 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-07-22 01:30:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:30:50,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2022-07-22 01:30:50,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2022-07-22 01:30:50,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-22 01:30:50,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-22 01:30:50,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2022-07-22 01:30:50,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:30:50,180 INFO L369 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-22 01:30:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2022-07-22 01:30:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2022-07-22 01:30:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-07-22 01:30:50,188 INFO L392 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-22 01:30:50,188 INFO L374 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-22 01:30:50,188 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:30:50,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2022-07-22 01:30:50,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:50,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:50,189 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:30:50,189 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:50,189 INFO L752 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 89#L10-2 assume !!(main_~i~0#1 < 100); 88#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 84#L10-2 [2022-07-22 01:30:50,189 INFO L754 eck$LassoCheckResult]: Loop: 84#L10-2 assume !!(main_~i~0#1 < 100); 85#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 84#L10-2 [2022-07-22 01:30:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-07-22 01:30:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987214656] [2022-07-22 01:30:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-07-22 01:30:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7929527] [2022-07-22 01:30:50,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 01:30:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-07-22 01:30:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661347697] [2022-07-22 01:30:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:50,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661347697] [2022-07-22 01:30:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661347697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:30:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059162941] [2022-07-22 01:30:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:30:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 01:30:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 01:30:50,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:50,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:30:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:50,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059162941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:30:50,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:30:50,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-22 01:30:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24824548] [2022-07-22 01:30:50,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:30:50,362 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:50,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:50,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:50,363 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:50,363 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:30:50,363 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,363 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:50,363 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:50,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2022-07-22 01:30:50,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:50,364 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:50,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:50,403 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:30:50,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,405 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:50,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:50,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 01:30:50,433 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:30:50,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:30:50,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:50,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:50,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 01:30:50,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:30:50,483 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:30:50,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:50,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:50,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:30:50,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:30:50,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:50,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:30:50,606 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:30:50,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,631 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:50,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:50,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:50,631 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:50,631 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:30:50,631 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,631 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:50,631 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:50,631 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2022-07-22 01:30:50,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:50,632 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:50,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:50,678 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:50,678 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:30:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:30:50,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:50,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:50,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:50,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:50,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:50,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:30:50,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:30:50,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:30:50,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,738 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:30:50,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:50,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:50,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:30:50,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:50,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:50,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:50,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:30:50,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:30:50,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:30:50,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:30:50,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:30:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:50,776 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:30:50,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:30:50,779 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:30:50,779 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:30:50,779 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-22 01:30:50,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,803 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:30:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:50,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:50,835 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:50,841 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 01:30:50,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,853 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. 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) Result 10 states and 13 transitions. Complement of second has 5 states. [2022-07-22 01:30:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-22 01:30:50,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 01:30:50,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 01:30:50,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-22 01:30:50,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:50,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2022-07-22 01:30:50,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2022-07-22 01:30:50,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:30:50,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-22 01:30:50,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-07-22 01:30:50,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:50,860 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-22 01:30:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-07-22 01:30:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 01:30:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-22 01:30:50,862 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-22 01:30:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:30:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:30:50,883 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:50,910 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-07-22 01:30:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:30:50,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-07-22 01:30:50,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2022-07-22 01:30:50,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-22 01:30:50,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-22 01:30:50,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-07-22 01:30:50,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:30:50,915 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-22 01:30:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-07-22 01:30:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-22 01:30:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-22 01:30:50,921 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-22 01:30:50,921 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-22 01:30:50,921 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:30:50,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-07-22 01:30:50,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:30:50,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:50,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:50,922 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2022-07-22 01:30:50,922 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:50,923 INFO L752 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 200#L10-2 assume !!(main_~i~0#1 < 100); 199#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 195#L10-2 assume !!(main_~i~0#1 < 100); 196#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 206#L10-2 assume !!(main_~i~0#1 < 100); 205#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 204#L10-2 assume !!(main_~i~0#1 < 100); 203#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 202#L10-2 [2022-07-22 01:30:50,923 INFO L754 eck$LassoCheckResult]: Loop: 202#L10-2 assume !!(main_~i~0#1 < 100); 201#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 202#L10-2 [2022-07-22 01:30:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2022-07-22 01:30:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364879869] [2022-07-22 01:30:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2022-07-22 01:30:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120108995] [2022-07-22 01:30:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:50,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2022-07-22 01:30:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:50,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868153050] [2022-07-22 01:30:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:51,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868153050] [2022-07-22 01:30:51,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868153050] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:30:51,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805610009] [2022-07-22 01:30:51,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:30:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:30:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 01:30:51,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:30:51,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:30:51,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:30:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805610009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:30:51,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:30:51,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-22 01:30:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885133132] [2022-07-22 01:30:51,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:30:51,168 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:51,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:51,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:51,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:51,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:30:51,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:51,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:51,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2022-07-22 01:30:51,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:51,169 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:51,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,205 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:51,205 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:30:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,207 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:51,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:51,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:30:51,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,257 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:30:51,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:30:51,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:51,295 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:30:51,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,318 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:51,318 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:51,318 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:51,318 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:51,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:30:51,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:51,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:51,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2022-07-22 01:30:51,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:51,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:51,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:51,362 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:30:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,364 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:51,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:51,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:30:51,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:51,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:51,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:51,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:30:51,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:30:51,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:30:51,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:30:51,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:30:51,421 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:30:51,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,423 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:30:51,431 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:30:51,431 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:30:51,431 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-22 01:30:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:30:51,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,454 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:30:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,493 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 01:30:51,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,503 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2022-07-22 01:30:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-22 01:30:51,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 01:30:51,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:51,506 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:30:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,537 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 01:30:51,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2022-07-22 01:30:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-22 01:30:51,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 01:30:51,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:51,549 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:30:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:51,579 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:51,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:51,581 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 1 loop predicates [2022-07-22 01:30:51,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,591 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2022-07-22 01:30:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-07-22 01:30:51,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 01:30:51,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:51,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-22 01:30:51,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:51,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-22 01:30:51,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:51,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-07-22 01:30:51,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:30:51,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2022-07-22 01:30:51,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-22 01:30:51,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-22 01:30:51,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-22 01:30:51,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:51,601 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-22 01:30:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-22 01:30:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-22 01:30:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-22 01:30:51,603 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-22 01:30:51,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:51,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 01:30:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-22 01:30:51,605 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:51,650 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-07-22 01:30:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 01:30:51,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2022-07-22 01:30:51,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:30:51,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2022-07-22 01:30:51,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 01:30:51,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 01:30:51,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-07-22 01:30:51,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:51,657 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-22 01:30:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-07-22 01:30:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-22 01:30:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-22 01:30:51,661 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-22 01:30:51,661 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-22 01:30:51,661 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:30:51,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2022-07-22 01:30:51,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:30:51,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:51,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:51,663 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2022-07-22 01:30:51,663 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:51,663 INFO L752 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 516#L10-2 assume !!(main_~i~0#1 < 100); 515#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L10-2 assume !!(main_~i~0#1 < 100); 509#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 532#L10-2 assume !!(main_~i~0#1 < 100); 531#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 530#L10-2 assume !!(main_~i~0#1 < 100); 529#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 528#L10-2 assume !!(main_~i~0#1 < 100); 527#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 526#L10-2 assume !!(main_~i~0#1 < 100); 525#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 524#L10-2 assume !!(main_~i~0#1 < 100); 523#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 522#L10-2 assume !!(main_~i~0#1 < 100); 521#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 520#L10-2 assume !!(main_~i~0#1 < 100); 519#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 518#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2022-07-22 01:30:51,663 INFO L754 eck$LassoCheckResult]: Loop: 512#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 517#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2022-07-22 01:30:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2022-07-22 01:30:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:51,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469761967] [2022-07-22 01:30:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-07-22 01:30:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024447899] [2022-07-22 01:30:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2022-07-22 01:30:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203161010] [2022-07-22 01:30:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:51,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:51,719 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:51,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:51,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:51,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:51,720 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:30:51,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:51,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:51,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2022-07-22 01:30:51,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:51,720 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,777 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:51,777 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:30:51,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,778 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:30:51,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:51,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:51,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,807 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:30:51,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:30:51,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:51,848 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:30:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,851 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:51,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:51,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:51,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:51,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:30:51,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:51,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:51,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2022-07-22 01:30:51,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:51,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:51,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:51,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:51,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:30:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,900 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:51,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:51,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:30:51,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:51,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:51,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:51,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:30:51,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:30:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:30:51,929 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:30:51,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:30:51,937 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:30:51,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:51,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:51,940 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:51,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:30:51,945 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:30:51,946 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:30:51,946 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2022-07-22 01:30:51,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:30:51,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:51,973 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:30:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,041 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:30:52,060 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2022-07-22 01:30:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-22 01:30:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2022-07-22 01:30:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2022-07-22 01:30:52,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2022-07-22 01:30:52,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2022-07-22 01:30:52,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:30:52,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2022-07-22 01:30:52,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-22 01:30:52,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-22 01:30:52,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2022-07-22 01:30:52,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:52,079 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-22 01:30:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2022-07-22 01:30:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-22 01:30:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-22 01:30:52,082 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-22 01:30:52,082 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-22 01:30:52,082 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:30:52,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-07-22 01:30:52,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:30:52,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:52,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:52,085 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2022-07-22 01:30:52,086 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:30:52,086 INFO L752 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 666#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 661#L10-2 assume !!(main_~i~0#1 < 100); 662#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 667#L10-2 assume !!(main_~i~0#1 < 100); 668#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 663#L10-2 assume !!(main_~i~0#1 < 100); 664#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 687#L10-2 assume !!(main_~i~0#1 < 100); 686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 685#L10-2 assume !!(main_~i~0#1 < 100); 684#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 683#L10-2 assume !!(main_~i~0#1 < 100); 682#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 681#L10-2 assume !!(main_~i~0#1 < 100); 680#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 679#L10-2 assume !!(main_~i~0#1 < 100); 678#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 677#L10-2 assume !!(main_~i~0#1 < 100); 676#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 675#L10-2 assume !!(main_~i~0#1 < 100); 674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 673#L10-2 assume !!(main_~i~0#1 < 100); 671#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 669#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2022-07-22 01:30:52,086 INFO L754 eck$LassoCheckResult]: Loop: 670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 672#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2022-07-22 01:30:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2022-07-22 01:30:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195920594] [2022-07-22 01:30:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:52,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195920594] [2022-07-22 01:30:52,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195920594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:30:52,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213592895] [2022-07-22 01:30:52,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:30:52,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:30:52,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:52,220 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:30:52,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-22 01:30:52,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-22 01:30:52,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:30:52,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:30:52,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213592895] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:30:52,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:30:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2022-07-22 01:30:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260402391] [2022-07-22 01:30:52,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:30:52,493 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:30:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2022-07-22 01:30:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898481068] [2022-07-22 01:30:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:52,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:52,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:52,516 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:52,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:52,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:52,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:52,516 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:30:52,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:52,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:52,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2022-07-22 01:30:52,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:52,517 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:52,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:52,552 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:30:52,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:52,553 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:52,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:30:52,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:30:52,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:52,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:52,579 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:30:52,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 01:30:52,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:30:52,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:30:52,606 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:30:52,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:52,609 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:30:52,609 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:30:52,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:30:52,609 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:30:52,609 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:30:52,609 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:30:52,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:30:52,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2022-07-22 01:30:52,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:30:52,610 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:30:52,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:30:52,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:30:52,655 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:30:52,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:52,657 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) [2022-07-22 01:30:52,659 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 [2022-07-22 01:30:52,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:30:52,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:30:52,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:30:52,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:30:52,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:30:52,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:30:52,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:30:52,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:30:52,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:30:52,669 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:30:52,669 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:30:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:30:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:52,671 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) [2022-07-22 01:30:52,672 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 [2022-07-22 01:30:52,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:30:52,673 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:30:52,673 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:30:52,673 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2022-07-22 01:30:52,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:52,690 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:30:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,764 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:30:52,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,787 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 38 states and 42 transitions. Complement of second has 5 states. [2022-07-22 01:30:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-22 01:30:52,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-22 01:30:52,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,788 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:30:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,836 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:30:52,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 39 states and 43 transitions. Complement of second has 5 states. [2022-07-22 01:30:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-22 01:30:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-22 01:30:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,866 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:30:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:52,920 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:30:52,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:52,949 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 [2022-07-22 01:30:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:52,958 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 2 loop predicates [2022-07-22 01:30:52,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 40 states and 45 transitions. Complement of second has 4 states. [2022-07-22 01:30:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:30:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-07-22 01:30:52,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-22 01:30:52,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-22 01:30:52,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2022-07-22 01:30:52,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:30:52,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-07-22 01:30:52,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-22 01:30:52,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2022-07-22 01:30:52,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-22 01:30:52,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-22 01:30:52,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2022-07-22 01:30:52,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:52,972 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-22 01:30:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2022-07-22 01:30:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-22 01:30:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-22 01:30:52,974 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-22 01:30:52,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 01:30:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-07-22 01:30:52,975 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:53,027 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-22 01:30:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 01:30:53,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2022-07-22 01:30:53,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:53,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2022-07-22 01:30:53,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-22 01:30:53,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-22 01:30:53,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2022-07-22 01:30:53,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:53,030 INFO L369 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-07-22 01:30:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2022-07-22 01:30:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-22 01:30:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-07-22 01:30:53,033 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-07-22 01:30:53,033 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-07-22 01:30:53,033 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:30:53,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2022-07-22 01:30:53,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:53,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:53,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:53,035 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2022-07-22 01:30:53,035 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-22 01:30:53,035 INFO L752 eck$LassoCheckResult]: Stem: 1337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1333#L10-2 assume !!(main_~i~0#1 < 100); 1334#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1339#L10-2 assume !!(main_~i~0#1 < 100); 1340#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1335#L10-2 assume !!(main_~i~0#1 < 100); 1336#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1382#L10-2 assume !!(main_~i~0#1 < 100); 1381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1380#L10-2 assume !!(main_~i~0#1 < 100); 1379#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1378#L10-2 assume !!(main_~i~0#1 < 100); 1377#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1376#L10-2 assume !!(main_~i~0#1 < 100); 1375#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1374#L10-2 assume !!(main_~i~0#1 < 100); 1373#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1372#L10-2 assume !!(main_~i~0#1 < 100); 1371#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1370#L10-2 assume !!(main_~i~0#1 < 100); 1369#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1368#L10-2 assume !!(main_~i~0#1 < 100); 1367#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1366#L10-2 assume !!(main_~i~0#1 < 100); 1365#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1364#L10-2 assume !!(main_~i~0#1 < 100); 1363#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1362#L10-2 assume !!(main_~i~0#1 < 100); 1361#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1360#L10-2 assume !!(main_~i~0#1 < 100); 1359#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1358#L10-2 assume !!(main_~i~0#1 < 100); 1357#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1356#L10-2 assume !!(main_~i~0#1 < 100); 1355#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1354#L10-2 assume !!(main_~i~0#1 < 100); 1353#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1352#L10-2 assume !!(main_~i~0#1 < 100); 1351#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1350#L10-2 assume !!(main_~i~0#1 < 100); 1349#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1348#L10-2 assume !!(main_~i~0#1 < 100); 1347#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1346#L10-2 assume !!(main_~i~0#1 < 100); 1345#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2022-07-22 01:30:53,036 INFO L754 eck$LassoCheckResult]: Loop: 1342#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2022-07-22 01:30:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2022-07-22 01:30:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:53,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669702076] [2022-07-22 01:30:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669702076] [2022-07-22 01:30:53,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669702076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:30:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415640213] [2022-07-22 01:30:53,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 01:30:53,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:30:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:53,328 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:30:53,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-22 01:30:53,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 01:30:53,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:30:53,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 01:30:53,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:53,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:30:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:54,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415640213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:30:54,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:30:54,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2022-07-22 01:30:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035329714] [2022-07-22 01:30:54,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:30:54,051 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:30:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2022-07-22 01:30:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:54,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881519529] [2022-07-22 01:30:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:54,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:54,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-22 01:30:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-07-22 01:30:54,086 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:54,209 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2022-07-22 01:30:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-22 01:30:54,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2022-07-22 01:30:54,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:54,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2022-07-22 01:30:54,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-22 01:30:54,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-22 01:30:54,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2022-07-22 01:30:54,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:54,215 INFO L369 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-07-22 01:30:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2022-07-22 01:30:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-07-22 01:30:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-22 01:30:54,234 INFO L392 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-22 01:30:54,234 INFO L374 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-22 01:30:54,234 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:30:54,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2022-07-22 01:30:54,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:54,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:54,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:54,237 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2022-07-22 01:30:54,237 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-22 01:30:54,238 INFO L752 eck$LassoCheckResult]: Stem: 1849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1845#L10-2 assume !!(main_~i~0#1 < 100); 1846#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1851#L10-2 assume !!(main_~i~0#1 < 100); 1852#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1847#L10-2 assume !!(main_~i~0#1 < 100); 1848#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1942#L10-2 assume !!(main_~i~0#1 < 100); 1941#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1940#L10-2 assume !!(main_~i~0#1 < 100); 1939#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1938#L10-2 assume !!(main_~i~0#1 < 100); 1937#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1936#L10-2 assume !!(main_~i~0#1 < 100); 1935#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1934#L10-2 assume !!(main_~i~0#1 < 100); 1933#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1932#L10-2 assume !!(main_~i~0#1 < 100); 1931#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1930#L10-2 assume !!(main_~i~0#1 < 100); 1929#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1928#L10-2 assume !!(main_~i~0#1 < 100); 1927#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1926#L10-2 assume !!(main_~i~0#1 < 100); 1925#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1924#L10-2 assume !!(main_~i~0#1 < 100); 1923#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1922#L10-2 assume !!(main_~i~0#1 < 100); 1921#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1920#L10-2 assume !!(main_~i~0#1 < 100); 1919#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1918#L10-2 assume !!(main_~i~0#1 < 100); 1917#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1916#L10-2 assume !!(main_~i~0#1 < 100); 1915#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1914#L10-2 assume !!(main_~i~0#1 < 100); 1913#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1912#L10-2 assume !!(main_~i~0#1 < 100); 1911#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1910#L10-2 assume !!(main_~i~0#1 < 100); 1909#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1908#L10-2 assume !!(main_~i~0#1 < 100); 1907#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1906#L10-2 assume !!(main_~i~0#1 < 100); 1905#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1904#L10-2 assume !!(main_~i~0#1 < 100); 1903#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1902#L10-2 assume !!(main_~i~0#1 < 100); 1901#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1900#L10-2 assume !!(main_~i~0#1 < 100); 1899#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1898#L10-2 assume !!(main_~i~0#1 < 100); 1897#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1896#L10-2 assume !!(main_~i~0#1 < 100); 1895#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1894#L10-2 assume !!(main_~i~0#1 < 100); 1893#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1892#L10-2 assume !!(main_~i~0#1 < 100); 1891#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1890#L10-2 assume !!(main_~i~0#1 < 100); 1889#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1888#L10-2 assume !!(main_~i~0#1 < 100); 1887#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1886#L10-2 assume !!(main_~i~0#1 < 100); 1885#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1884#L10-2 assume !!(main_~i~0#1 < 100); 1883#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1882#L10-2 assume !!(main_~i~0#1 < 100); 1881#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1880#L10-2 assume !!(main_~i~0#1 < 100); 1879#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1878#L10-2 assume !!(main_~i~0#1 < 100); 1877#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1876#L10-2 assume !!(main_~i~0#1 < 100); 1875#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1874#L10-2 assume !!(main_~i~0#1 < 100); 1873#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1872#L10-2 assume !!(main_~i~0#1 < 100); 1871#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1870#L10-2 assume !!(main_~i~0#1 < 100); 1869#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1868#L10-2 assume !!(main_~i~0#1 < 100); 1867#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1866#L10-2 assume !!(main_~i~0#1 < 100); 1865#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1864#L10-2 assume !!(main_~i~0#1 < 100); 1863#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1862#L10-2 assume !!(main_~i~0#1 < 100); 1861#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1860#L10-2 assume !!(main_~i~0#1 < 100); 1859#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1858#L10-2 assume !!(main_~i~0#1 < 100); 1857#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2022-07-22 01:30:54,238 INFO L754 eck$LassoCheckResult]: Loop: 1854#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2022-07-22 01:30:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2022-07-22 01:30:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:54,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932999276] [2022-07-22 01:30:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:30:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:30:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932999276] [2022-07-22 01:30:55,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932999276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:30:55,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544444135] [2022-07-22 01:30:55,186 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 01:30:55,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:30:55,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:30:55,188 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:30:55,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-22 01:30:55,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2022-07-22 01:30:55,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:30:55,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 01:30:55,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:30:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:55,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:30:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:30:55,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544444135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:30:55,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:30:55,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2022-07-22 01:30:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725116794] [2022-07-22 01:30:55,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:30:55,657 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:30:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2022-07-22 01:30:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:55,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857561058] [2022-07-22 01:30:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:30:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 01:30:55,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-07-22 01:30:55,688 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:30:55,816 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2022-07-22 01:30:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-22 01:30:55,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2022-07-22 01:30:55,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:55,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2022-07-22 01:30:55,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-22 01:30:55,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-22 01:30:55,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2022-07-22 01:30:55,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:30:55,819 INFO L369 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-07-22 01:30:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2022-07-22 01:30:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-07-22 01:30:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:30:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2022-07-22 01:30:55,822 INFO L392 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2022-07-22 01:30:55,822 INFO L374 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2022-07-22 01:30:55,822 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:30:55,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2022-07-22 01:30:55,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:30:55,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:30:55,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:30:55,828 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2022-07-22 01:30:55,830 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-22 01:30:55,831 INFO L752 eck$LassoCheckResult]: Stem: 2689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2685#L10-2 assume !!(main_~i~0#1 < 100); 2686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2691#L10-2 assume !!(main_~i~0#1 < 100); 2692#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2687#L10-2 assume !!(main_~i~0#1 < 100); 2688#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2790#L10-2 assume !!(main_~i~0#1 < 100); 2789#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2788#L10-2 assume !!(main_~i~0#1 < 100); 2787#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2786#L10-2 assume !!(main_~i~0#1 < 100); 2785#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2784#L10-2 assume !!(main_~i~0#1 < 100); 2783#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2782#L10-2 assume !!(main_~i~0#1 < 100); 2781#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2780#L10-2 assume !!(main_~i~0#1 < 100); 2779#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2778#L10-2 assume !!(main_~i~0#1 < 100); 2777#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2776#L10-2 assume !!(main_~i~0#1 < 100); 2775#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2774#L10-2 assume !!(main_~i~0#1 < 100); 2773#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2772#L10-2 assume !!(main_~i~0#1 < 100); 2771#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2770#L10-2 assume !!(main_~i~0#1 < 100); 2769#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2768#L10-2 assume !!(main_~i~0#1 < 100); 2767#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2766#L10-2 assume !!(main_~i~0#1 < 100); 2765#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2764#L10-2 assume !!(main_~i~0#1 < 100); 2763#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2762#L10-2 assume !!(main_~i~0#1 < 100); 2761#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2760#L10-2 assume !!(main_~i~0#1 < 100); 2759#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2758#L10-2 assume !!(main_~i~0#1 < 100); 2757#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2756#L10-2 assume !!(main_~i~0#1 < 100); 2755#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2754#L10-2 assume !!(main_~i~0#1 < 100); 2753#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2752#L10-2 assume !!(main_~i~0#1 < 100); 2751#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2750#L10-2 assume !!(main_~i~0#1 < 100); 2749#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2748#L10-2 assume !!(main_~i~0#1 < 100); 2747#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2746#L10-2 assume !!(main_~i~0#1 < 100); 2745#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2744#L10-2 assume !!(main_~i~0#1 < 100); 2743#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2742#L10-2 assume !!(main_~i~0#1 < 100); 2741#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2740#L10-2 assume !!(main_~i~0#1 < 100); 2739#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2738#L10-2 assume !!(main_~i~0#1 < 100); 2737#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2736#L10-2 assume !!(main_~i~0#1 < 100); 2735#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2734#L10-2 assume !!(main_~i~0#1 < 100); 2733#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2732#L10-2 assume !!(main_~i~0#1 < 100); 2731#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2730#L10-2 assume !!(main_~i~0#1 < 100); 2729#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2728#L10-2 assume !!(main_~i~0#1 < 100); 2727#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2726#L10-2 assume !!(main_~i~0#1 < 100); 2725#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2724#L10-2 assume !!(main_~i~0#1 < 100); 2723#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2722#L10-2 assume !!(main_~i~0#1 < 100); 2721#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2720#L10-2 assume !!(main_~i~0#1 < 100); 2719#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2718#L10-2 assume !!(main_~i~0#1 < 100); 2717#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2716#L10-2 assume !!(main_~i~0#1 < 100); 2715#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2714#L10-2 assume !!(main_~i~0#1 < 100); 2713#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2712#L10-2 assume !!(main_~i~0#1 < 100); 2711#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2710#L10-2 assume !!(main_~i~0#1 < 100); 2709#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2708#L10-2 assume !!(main_~i~0#1 < 100); 2707#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2706#L10-2 assume !!(main_~i~0#1 < 100); 2705#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2704#L10-2 assume !!(main_~i~0#1 < 100); 2703#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2702#L10-2 assume !!(main_~i~0#1 < 100); 2701#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2700#L10-2 assume !!(main_~i~0#1 < 100); 2699#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2698#L10-2 assume !!(main_~i~0#1 < 100); 2697#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2022-07-22 01:30:55,832 INFO L754 eck$LassoCheckResult]: Loop: 2694#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2022-07-22 01:30:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2022-07-22 01:30:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:55,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895408603] [2022-07-22 01:30:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2022-07-22 01:30:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:55,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024405705] [2022-07-22 01:30:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:30:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2022-07-22 01:30:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:30:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584090407] [2022-07-22 01:30:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:30:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:30:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:30:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:30:55,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:30:56,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:30:56 BoogieIcfgContainer [2022-07-22 01:30:56,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:30:56,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:30:56,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:30:56,945 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:30:56,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:30:48" (3/4) ... [2022-07-22 01:30:56,947 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 01:30:56,980 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 01:30:56,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:30:56,981 INFO L158 Benchmark]: Toolchain (without parser) took 8446.84ms. Allocated memory was 52.4MB in the beginning and 92.3MB in the end (delta: 39.8MB). Free memory was 30.7MB in the beginning and 49.7MB in the end (delta: -19.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-07-22 01:30:56,981 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.7MB in the beginning and 34.7MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:30:56,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.10ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 30.4MB in the beginning and 48.2MB in the end (delta: -17.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-07-22 01:30:56,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.98ms. Allocated memory is still 62.9MB. Free memory was 48.2MB in the beginning and 46.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:30:56,982 INFO L158 Benchmark]: Boogie Preprocessor took 13.53ms. Allocated memory is still 62.9MB. Free memory was 46.9MB in the beginning and 46.0MB in the end (delta: 879.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:30:56,982 INFO L158 Benchmark]: RCFGBuilder took 199.18ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 38.4MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 01:30:56,983 INFO L158 Benchmark]: BuchiAutomizer took 7969.95ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 38.2MB in the beginning and 52.7MB in the end (delta: -14.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-07-22 01:30:56,983 INFO L158 Benchmark]: Witness Printer took 35.89ms. Allocated memory is still 92.3MB. Free memory was 52.7MB in the beginning and 49.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:30:56,985 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.19ms. Allocated memory is still 52.4MB. Free memory was 34.7MB in the beginning and 34.7MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.10ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 30.4MB in the beginning and 48.2MB in the end (delta: -17.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.98ms. Allocated memory is still 62.9MB. Free memory was 48.2MB in the beginning and 46.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.53ms. Allocated memory is still 62.9MB. Free memory was 46.9MB in the beginning and 46.0MB in the end (delta: 879.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 199.18ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 38.4MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 7969.95ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 38.2MB in the beginning and 52.7MB in the end (delta: -14.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Witness Printer took 35.89ms. Allocated memory is still 92.3MB. Free memory was 52.7MB in the beginning and 49.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. 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 11 terminating modules (6 trivial, 3 deterministic, 2 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 i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 6.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 54 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax199 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: 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=49, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 01:30:57,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:57,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:57,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:57,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:57,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 01:30:58,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)