./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 21:57:26,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 21:57:26,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 21:57:26,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 21:57:26,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 21:57:26,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 21:57:26,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 21:57:26,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 21:57:26,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 21:57:26,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 21:57:26,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 21:57:26,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 21:57:26,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 21:57:26,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 21:57:26,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 21:57:26,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 21:57:26,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 21:57:26,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 21:57:26,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 21:57:26,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 21:57:26,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 21:57:26,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 21:57:26,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 21:57:26,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 21:57:26,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 21:57:26,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 21:57:26,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 21:57:26,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 21:57:26,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 21:57:26,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 21:57:26,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 21:57:26,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 21:57:26,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 21:57:26,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 21:57:26,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 21:57:26,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 21:57:26,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 21:57:26,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 21:57:26,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 21:57:26,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 21:57:26,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 21:57:26,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-21 21:57:26,625 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 21:57:26,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 21:57:26,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 21:57:26,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 21:57:26,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 21:57:26,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 21:57:26,627 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 21:57:26,628 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 21:57:26,628 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 21:57:26,628 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 21:57:26,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 21:57:26,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 21:57:26,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 21:57:26,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 21:57:26,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 21:57:26,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 21:57:26,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 21:57:26,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 21:57:26,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 21:57:26,632 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 21:57:26,632 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2021-12-21 21:57:26,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 21:57:26,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 21:57:26,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 21:57:26,798 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 21:57:26,798 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 21:57:26,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2021-12-21 21:57:26,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052c0da7f/510a57b0ad70472eb843533dbdc1192f/FLAGa250c5da8 [2021-12-21 21:57:27,153 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 21:57:27,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2021-12-21 21:57:27,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052c0da7f/510a57b0ad70472eb843533dbdc1192f/FLAGa250c5da8 [2021-12-21 21:57:27,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052c0da7f/510a57b0ad70472eb843533dbdc1192f [2021-12-21 21:57:27,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 21:57:27,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 21:57:27,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:27,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 21:57:27,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 21:57:27,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc028f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27, skipping insertion in model container [2021-12-21 21:57:27,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 21:57:27,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 21:57:27,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:27,763 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 21:57:27,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:27,782 INFO L208 MainTranslator]: Completed translation [2021-12-21 21:57:27,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27 WrapperNode [2021-12-21 21:57:27,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:27,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:27,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 21:57:27,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 21:57:27,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,801 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2021-12-21 21:57:27,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:27,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 21:57:27,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 21:57:27,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 21:57:27,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 21:57:27,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 21:57:27,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 21:57:27,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 21:57:27,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (1/1) ... [2021-12-21 21:57:27,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:27,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:27,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 21:57:27,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 21:57:27,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 21:57:27,904 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 21:57:27,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 21:57:27,972 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 21:57:27,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 21:57:27,976 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 21:57:27,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:27 BoogieIcfgContainer [2021-12-21 21:57:27,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 21:57:27,978 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 21:57:27,978 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 21:57:27,980 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 21:57:27,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:27,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 09:57:27" (1/3) ... [2021-12-21 21:57:27,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bab9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:27, skipping insertion in model container [2021-12-21 21:57:27,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:27,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:27" (2/3) ... [2021-12-21 21:57:27,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38bab9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:27, skipping insertion in model container [2021-12-21 21:57:27,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:27,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:27" (3/3) ... [2021-12-21 21:57:27,984 INFO L388 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2021-12-21 21:57:28,021 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 21:57:28,021 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 21:57:28,021 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 21:57:28,021 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 21:57:28,021 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 21:57:28,021 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 21:57:28,021 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 21:57:28,022 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 21:57:28,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:28,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:28,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:28,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:28,041 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:28,041 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:28,041 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 21:57:28,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:28,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:28,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:28,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:28,043 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:28,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:28,047 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 6#L18-1true [2021-12-21 21:57:28,047 INFO L793 eck$LassoCheckResult]: Loop: 6#L18-1true assume !!(main_~i~0#1 > 0); 11#L12true assume !(1 == main_~i~0#1); 3#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 8#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6#L18-1true [2021-12-21 21:57:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 21:57:28,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119045281] [2021-12-21 21:57:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2021-12-21 21:57:28,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468968928] [2021-12-21 21:57:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:28,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468968928] [2021-12-21 21:57:28,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468968928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:28,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:28,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 21:57:28,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643288124] [2021-12-21 21:57:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:28,201 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 21:57:28,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 21:57:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 21:57:28,225 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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, 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) [2021-12-21 21:57:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:28,265 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2021-12-21 21:57:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 21:57:28,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-21 21:57:28,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-21 21:57:28,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2021-12-21 21:57:28,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-21 21:57:28,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-21 21:57:28,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2021-12-21 21:57:28,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:28,290 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-21 21:57:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2021-12-21 21:57:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-21 21:57:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2021-12-21 21:57:28,308 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-21 21:57:28,309 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-21 21:57:28,309 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 21:57:28,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2021-12-21 21:57:28,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-21 21:57:28,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:28,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:28,311 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:28,311 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:28,311 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 44#L18-1 [2021-12-21 21:57:28,312 INFO L793 eck$LassoCheckResult]: Loop: 44#L18-1 assume !!(main_~i~0#1 > 0); 46#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44#L18-1 [2021-12-21 21:57:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-21 21:57:28,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367160682] [2021-12-21 21:57:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2021-12-21 21:57:28,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708967431] [2021-12-21 21:57:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:28,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:28,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708967431] [2021-12-21 21:57:28,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708967431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:28,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:28,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 21:57:28,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923121917] [2021-12-21 21:57:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:28,351 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 21:57:28,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 21:57:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 21:57:28,352 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 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) [2021-12-21 21:57:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:28,377 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2021-12-21 21:57:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 21:57:28,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2021-12-21 21:57:28,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:28,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2021-12-21 21:57:28,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 21:57:28,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 21:57:28,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2021-12-21 21:57:28,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:28,381 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-21 21:57:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2021-12-21 21:57:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-21 21:57:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2021-12-21 21:57:28,384 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-21 21:57:28,384 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-21 21:57:28,384 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 21:57:28,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2021-12-21 21:57:28,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:28,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:28,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:28,385 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:28,385 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:28,385 INFO L791 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 74#L18-1 [2021-12-21 21:57:28,385 INFO L793 eck$LassoCheckResult]: Loop: 74#L18-1 assume !!(main_~i~0#1 > 0); 80#L12 assume !(1 == main_~i~0#1); 79#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 73#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 74#L18-1 [2021-12-21 21:57:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-21 21:57:28,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116381716] [2021-12-21 21:57:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2021-12-21 21:57:28,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278746110] [2021-12-21 21:57:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,418 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2021-12-21 21:57:28,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:28,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512779147] [2021-12-21 21:57:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:28,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:28,441 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:28,484 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:28,484 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:28,484 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:28,484 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:28,485 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:28,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:28,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:28,485 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2021-12-21 21:57:28,485 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:28,485 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:28,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:28,543 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:28,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 21:57:28,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:28,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:28,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:28,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:28,628 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 [2021-12-21 21:57:28,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 21:57:28,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:28,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:28,643 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:28,643 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:28,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:28,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 21:57:28,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:28,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:28,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-21 21:57:28,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,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) [2021-12-21 21:57:28,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 [2021-12-21 21:57:28,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:28,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:28,705 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:28,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:28,720 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:28,720 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:28,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:28,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:28,720 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:28,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:28,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:28,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2021-12-21 21:57:28,721 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:28,721 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:28,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:28,768 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:28,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:28,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:28,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:28,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:28,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:28,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:28,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:28,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:28,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:28,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 21:57:28,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:28,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:28,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 21:57:28,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:28,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:28,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:28,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:28,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:28,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:28,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:28,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:28,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:28,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 21:57:28,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:28,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:28,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:28,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:28,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:28,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:28,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:28,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:28,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:28,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 21:57:28,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:28,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:28,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:28,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:28,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:28,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:28,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:28,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:28,929 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:28,931 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:28,931 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:28,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:28,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-21 21:57:28,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:28,935 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:28,935 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:28,935 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:28,950 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 [2021-12-21 21:57:28,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:28,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:28,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:28,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:28,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:28,999 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 [2021-12-21 21:57:28,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 51 transitions. Complement of second has 7 states. [2021-12-21 21:57:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-12-21 21:57:29,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-21 21:57:29,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-21 21:57:29,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2021-12-21 21:57:29,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2021-12-21 21:57:29,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2021-12-21 21:57:29,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2021-12-21 21:57:29,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-21 21:57:29,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-21 21:57:29,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2021-12-21 21:57:29,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:29,031 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2021-12-21 21:57:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2021-12-21 21:57:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-21 21:57:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2021-12-21 21:57:29,033 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2021-12-21 21:57:29,033 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2021-12-21 21:57:29,033 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 21:57:29,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2021-12-21 21:57:29,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-21 21:57:29,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:29,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:29,034 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-21 21:57:29,034 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:29,034 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 170#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2021-12-21 21:57:29,034 INFO L793 eck$LassoCheckResult]: Loop: 164#L12 assume !(1 == main_~i~0#1); 180#L12-2 assume !(10 == main_~i~0#1); 169#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 163#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2021-12-21 21:57:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2021-12-21 21:57:29,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194573863] [2021-12-21 21:57:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2021-12-21 21:57:29,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105313340] [2021-12-21 21:57:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,043 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2021-12-21 21:57:29,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275424797] [2021-12-21 21:57:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,048 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,068 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:29,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:29,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:29,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:29,068 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:29,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:29,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:29,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2021-12-21 21:57:29,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:29,068 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:29,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:29,123 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:29,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,124 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-21 21:57:29,177 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,177 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:29,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-21 21:57:29,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-21 21:57:29,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-21 21:57:29,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:29,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,301 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:29,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-21 21:57:29,304 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:29,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:29,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:29,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:29,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:29,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:29,304 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:29,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2021-12-21 21:57:29,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:29,310 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:29,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,400 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:29,400 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:29,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-21 21:57:29,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:29,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:29,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:29,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:29,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:29,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:29,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:29,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:29,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-21 21:57:29,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:29,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:29,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:29,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:29,450 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 21:57:29,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:29,452 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 21:57:29,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:29,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:29,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:29,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:29,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,469 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-21 21:57:29,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:29,471 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:29,471 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:29,472 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:29,488 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 [2021-12-21 21:57:29,489 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:29,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:29,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:29,514 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:29,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:29,536 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 [2021-12-21 21:57:29,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 59 transitions. Complement of second has 7 states. [2021-12-21 21:57:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-12-21 21:57:29,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-21 21:57:29,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-21 21:57:29,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2021-12-21 21:57:29,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:29,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2021-12-21 21:57:29,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:29,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2021-12-21 21:57:29,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-21 21:57:29,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-21 21:57:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2021-12-21 21:57:29,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:29,557 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-21 21:57:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2021-12-21 21:57:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-21 21:57:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2021-12-21 21:57:29,560 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-21 21:57:29,560 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-21 21:57:29,560 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 21:57:29,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2021-12-21 21:57:29,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:29,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:29,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:29,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-21 21:57:29,561 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:29,561 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 281#L18-1 assume !!(main_~i~0#1 > 0); 284#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 286#L12-2 assume !(10 == main_~i~0#1); 291#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2021-12-21 21:57:29,562 INFO L793 eck$LassoCheckResult]: Loop: 292#L18-1 assume !!(main_~i~0#1 > 0); 299#L12 assume !(1 == main_~i~0#1); 293#L12-2 assume !(10 == main_~i~0#1); 294#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2021-12-21 21:57:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2021-12-21 21:57:29,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86198793] [2021-12-21 21:57:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2021-12-21 21:57:29,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978233976] [2021-12-21 21:57:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,572 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2021-12-21 21:57:29,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:29,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881015267] [2021-12-21 21:57:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:29,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:29,578 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:29,597 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:29,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:29,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:29,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:29,598 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:29,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:29,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:29,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2021-12-21 21:57:29,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:29,598 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,670 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:29,670 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:29,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,671 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-21 21:57:29,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,691 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,691 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:29,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-21 21:57:29,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,709 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-21 21:57:29,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,732 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:29,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,749 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-21 21:57:29,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,778 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:29,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-21 21:57:29,805 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,805 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=11} Honda state: {ULTIMATE.start_main_~i~0#1=11} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [0, 0, 1] Nus: [0, 0] [2021-12-21 21:57:29,820 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 [2021-12-21 21:57:29,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,821 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-21 21:57:29,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:29,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:29,880 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:29,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:29,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:29,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:29,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:29,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:29,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:29,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2021-12-21 21:57:29,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:29,881 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:29,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:29,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:29,973 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:29,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:29,974 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:29,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-21 21:57:29,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:29,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:29,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:29,987 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:30,002 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 [2021-12-21 21:57:30,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,003 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-21 21:57:30,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:30,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:30,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-21 21:57:30,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,028 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-21 21:57:30,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:30,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:30,054 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:30,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:30,057 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:30,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:30,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:30,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:30,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:30,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:30,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:30,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2021-12-21 21:57:30,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:30,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:30,164 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:30,164 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:30,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,165 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) [2021-12-21 21:57:30,165 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 [2021-12-21 21:57:30,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:30,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:30,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:30,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:30,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:30,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:30,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:30,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:30,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:30,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-21 21:57:30,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,238 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-21 21:57:30,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:30,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:30,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:30,245 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 21:57:30,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:30,250 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-21 21:57:30,250 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-21 21:57:30,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:30,284 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-21 21:57:30,284 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-21 21:57:30,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,285 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-21 21:57:30,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:30,295 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-12-21 21:57:30,295 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:30,295 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2021-12-21 21:57:30,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-21 21:57:30,334 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2021-12-21 21:57:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:30,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,377 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:30,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,398 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-21 21:57:30,398 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Result 46 states and 68 transitions. Complement of second has 8 states. [2021-12-21 21:57:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-12-21 21:57:30,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-21 21:57:30,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-21 21:57:30,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2021-12-21 21:57:30,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2021-12-21 21:57:30,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:30,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2021-12-21 21:57:30,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-21 21:57:30,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-21 21:57:30,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2021-12-21 21:57:30,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:30,440 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 67 transitions. [2021-12-21 21:57:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2021-12-21 21:57:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-12-21 21:57:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2021-12-21 21:57:30,443 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2021-12-21 21:57:30,443 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2021-12-21 21:57:30,443 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 21:57:30,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2021-12-21 21:57:30,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-21 21:57:30,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:30,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:30,444 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 21:57:30,444 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:30,444 INFO L791 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 426#L18-1 assume !!(main_~i~0#1 > 0); 435#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 432#L12-2 assume !(10 == main_~i~0#1); 431#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 430#L18-1 assume !!(main_~i~0#1 > 0); 427#L12 assume !(1 == main_~i~0#1); 428#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2021-12-21 21:57:30,445 INFO L793 eck$LassoCheckResult]: Loop: 452#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 417#L18-1 assume !!(main_~i~0#1 > 0); 418#L12 assume !(1 == main_~i~0#1); 451#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2021-12-21 21:57:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2021-12-21 21:57:30,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812875558] [2021-12-21 21:57:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:30,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812875558] [2021-12-21 21:57:30,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812875558] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252502183] [2021-12-21 21:57:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:30,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,461 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-21 21:57:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 21:57:30,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252502183] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:30,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:30,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-21 21:57:30,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502893247] [2021-12-21 21:57:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:30,515 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2021-12-21 21:57:30,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:30,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031412731] [2021-12-21 21:57:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:30,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:30,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:30,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:30,546 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:30,546 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:30,546 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:30,546 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:30,547 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:30,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:30,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:30,547 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2021-12-21 21:57:30,547 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:30,547 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:30,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,587 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:30,588 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:30,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,589 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:30,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:30,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-21 21:57:30,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-21 21:57:30,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,622 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-21 21:57:30,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:30,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:30,694 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:30,697 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 [2021-12-21 21:57:30,697 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:30,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:30,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:30,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:30,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:30,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:30,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:30,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2021-12-21 21:57:30,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:30,698 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:30,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:30,746 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:30,746 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:30,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,747 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-21 21:57:30,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:30,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:30,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:30,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:30,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:30,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:30,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:30,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:30,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:30,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:30,764 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:30,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:30,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:30,766 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:30,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-21 21:57:30,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:30,767 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:30,767 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:30,767 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:30,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:30,796 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:30,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:30,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,835 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 [2021-12-21 21:57:30,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 105 states and 160 transitions. Complement of second has 7 states. [2021-12-21 21:57:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-12-21 21:57:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-21 21:57:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2021-12-21 21:57:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2021-12-21 21:57:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:30,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2021-12-21 21:57:30,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-12-21 21:57:30,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2021-12-21 21:57:30,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-21 21:57:30,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-21 21:57:30,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:30,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2021-12-21 21:57:30,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:30,907 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 133 transitions. [2021-12-21 21:57:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2021-12-21 21:57:30,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2021-12-21 21:57:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2021-12-21 21:57:30,911 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 127 transitions. [2021-12-21 21:57:30,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 21:57:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 21:57:30,911 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:30,946 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2021-12-21 21:57:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 21:57:30,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2021-12-21 21:57:30,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-21 21:57:30,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2021-12-21 21:57:30,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2021-12-21 21:57:30,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2021-12-21 21:57:30,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2021-12-21 21:57:30,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:30,952 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 239 transitions. [2021-12-21 21:57:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2021-12-21 21:57:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2021-12-21 21:57:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2021-12-21 21:57:30,968 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2021-12-21 21:57:30,968 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2021-12-21 21:57:30,968 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 21:57:30,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2021-12-21 21:57:30,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2021-12-21 21:57:30,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:30,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:30,969 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2021-12-21 21:57:30,969 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:30,969 INFO L791 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 928#L18-1 assume !!(main_~i~0#1 > 0); 942#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 938#L12-2 assume !(10 == main_~i~0#1); 933#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 934#L18-1 assume !!(main_~i~0#1 > 0); 1009#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 972#L12-2 assume !(10 == main_~i~0#1); 1014#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2021-12-21 21:57:30,969 INFO L793 eck$LassoCheckResult]: Loop: 990#L18-1 assume !!(main_~i~0#1 > 0); 1000#L12 assume !(1 == main_~i~0#1); 983#L12-2 assume !(10 == main_~i~0#1); 995#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2021-12-21 21:57:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2021-12-21 21:57:30,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:30,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032215719] [2021-12-21 21:57:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:30,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:30,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:30,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032215719] [2021-12-21 21:57:30,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032215719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:30,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:30,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 21:57:30,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059370716] [2021-12-21 21:57:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:30,992 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2021-12-21 21:57:30,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:30,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725005024] [2021-12-21 21:57:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:30,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:30,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:30,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:31,012 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:31,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:31,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:31,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:31,012 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:31,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:31,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:31,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2021-12-21 21:57:31,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:31,013 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:31,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:31,075 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:31,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,076 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-21 21:57:31,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:31,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-21 21:57:31,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,102 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-21 21:57:31,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:31,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,133 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:31,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-21 21:57:31,135 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:31,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:31,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:31,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:31,135 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:31,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:31,135 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:31,135 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2021-12-21 21:57:31,135 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:31,135 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:31,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,209 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:31,209 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:31,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,210 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-21 21:57:31,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:31,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:31,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:31,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:31,217 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 21:57:31,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:31,219 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 21:57:31,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:31,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:31,225 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:31,225 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:31,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,226 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-21 21:57:31,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:31,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:31,228 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:31,228 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:31,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,245 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,288 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:31,306 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 [2021-12-21 21:57:31,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:31,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 248 states and 381 transitions. Complement of second has 5 states. [2021-12-21 21:57:31,321 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 [2021-12-21 21:57:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-21 21:57:31,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-21 21:57:31,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:31,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-21 21:57:31,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:31,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-21 21:57:31,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:31,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2021-12-21 21:57:31,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2021-12-21 21:57:31,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2021-12-21 21:57:31,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-12-21 21:57:31,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2021-12-21 21:57:31,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2021-12-21 21:57:31,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:31,325 INFO L681 BuchiCegarLoop]: Abstraction has 224 states and 333 transitions. [2021-12-21 21:57:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2021-12-21 21:57:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2021-12-21 21:57:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2021-12-21 21:57:31,329 INFO L704 BuchiCegarLoop]: Abstraction has 202 states and 304 transitions. [2021-12-21 21:57:31,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 21:57:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 21:57:31,330 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:31,342 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2021-12-21 21:57:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 21:57:31,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2021-12-21 21:57:31,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2021-12-21 21:57:31,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2021-12-21 21:57:31,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2021-12-21 21:57:31,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2021-12-21 21:57:31,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2021-12-21 21:57:31,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:31,345 INFO L681 BuchiCegarLoop]: Abstraction has 230 states and 313 transitions. [2021-12-21 21:57:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2021-12-21 21:57:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2021-12-21 21:57:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2021-12-21 21:57:31,349 INFO L704 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2021-12-21 21:57:31,349 INFO L587 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2021-12-21 21:57:31,349 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 21:57:31,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2021-12-21 21:57:31,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-21 21:57:31,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:31,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:31,350 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1] [2021-12-21 21:57:31,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-21 21:57:31,350 INFO L791 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1808#L18-1 assume !!(main_~i~0#1 > 0); 1828#L12 assume !(1 == main_~i~0#1); 1829#L12-2 assume !(10 == main_~i~0#1); 1845#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1846#L18-1 assume !!(main_~i~0#1 > 0); 1902#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1835#L12-2 assume !(10 == main_~i~0#1); 1836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1893#L18-1 assume !!(main_~i~0#1 > 0); 1894#L12 assume !(1 == main_~i~0#1); 1949#L12-2 assume !(10 == main_~i~0#1); 1948#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2021-12-21 21:57:31,350 INFO L793 eck$LassoCheckResult]: Loop: 1929#L18-1 assume !!(main_~i~0#1 > 0); 1944#L12 assume !(1 == main_~i~0#1); 1945#L12-2 assume !(10 == main_~i~0#1); 1947#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2021-12-21 21:57:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1847785984, now seen corresponding path program 1 times [2021-12-21 21:57:31,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:31,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227707684] [2021-12-21 21:57:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:31,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 21:57:31,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227707684] [2021-12-21 21:57:31,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227707684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:31,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:31,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 21:57:31,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240835561] [2021-12-21 21:57:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:31,371 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2021-12-21 21:57:31,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:31,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154696861] [2021-12-21 21:57:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:31,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:31,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:31,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:31,390 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:31,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:31,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:31,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:31,390 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:31,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:31,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:31,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2021-12-21 21:57:31,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:31,391 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:31,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,445 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:31,445 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:31,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,446 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-21 21:57:31,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:31,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,463 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:31,463 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:31,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,478 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-21 21:57:31,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:31,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,490 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:31,490 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:31,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-21 21:57:31,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,505 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-21 21:57:31,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:31,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,516 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:31,516 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:31,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-21 21:57:31,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,531 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-21 21:57:31,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:31,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,558 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-21 21:57:31,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:31,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:31,588 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:31,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,593 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:31,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:31,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:31,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:31,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:31,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:31,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:31,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2021-12-21 21:57:31,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:31,593 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:31,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,676 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:31,676 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:31,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,677 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-21 21:57:31,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:31,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:31,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:31,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:31,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:31,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:31,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:31,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:31,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,722 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-21 21:57:31,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:31,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:31,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:31,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:31,729 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 21:57:31,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:31,729 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 21:57:31,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:31,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:31,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:31,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,761 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-21 21:57:31,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:31,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:31,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:31,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:31,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:31,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:31,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:31,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:31,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-21 21:57:31,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,800 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-21 21:57:31,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:31,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:31,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:31,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:31,808 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 21:57:31,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:31,809 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 21:57:31,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:31,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:31,821 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-21 21:57:31,822 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:31,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:31,822 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-21 21:57:31,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:31,824 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:31,824 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:31,824 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:31,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-21 21:57:31,838 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,889 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:31,906 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 [2021-12-21 21:57:31,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:31,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2021-12-21 21:57:31,919 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 [2021-12-21 21:57:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-21 21:57:31,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-21 21:57:31,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:31,920 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:31,964 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:31,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:31,980 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 [2021-12-21 21:57:31,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:31,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2021-12-21 21:57:31,991 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 [2021-12-21 21:57:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-21 21:57:31,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-21 21:57:31,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:31,992 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,023 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,038 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 [2021-12-21 21:57:32,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:32,050 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 334 states and 496 transitions. Complement of second has 4 states. [2021-12-21 21:57:32,050 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 [2021-12-21 21:57:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2021-12-21 21:57:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2021-12-21 21:57:32,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-21 21:57:32,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:32,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2021-12-21 21:57:32,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:32,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2021-12-21 21:57:32,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:32,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2021-12-21 21:57:32,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-12-21 21:57:32,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2021-12-21 21:57:32,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2021-12-21 21:57:32,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2021-12-21 21:57:32,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2021-12-21 21:57:32,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:32,056 INFO L681 BuchiCegarLoop]: Abstraction has 268 states and 378 transitions. [2021-12-21 21:57:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2021-12-21 21:57:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2021-12-21 21:57:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2021-12-21 21:57:32,059 INFO L704 BuchiCegarLoop]: Abstraction has 167 states and 234 transitions. [2021-12-21 21:57:32,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 21:57:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 21:57:32,059 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:32,063 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-21 21:57:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 21:57:32,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 118 transitions. [2021-12-21 21:57:32,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-21 21:57:32,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 94 transitions. [2021-12-21 21:57:32,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-12-21 21:57:32,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-12-21 21:57:32,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2021-12-21 21:57:32,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:32,065 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2021-12-21 21:57:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2021-12-21 21:57:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-12-21 21:57:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1625) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2021-12-21 21:57:32,066 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-12-21 21:57:32,066 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-12-21 21:57:32,066 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 21:57:32,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2021-12-21 21:57:32,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2021-12-21 21:57:32,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:32,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:32,068 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 1, 1, 1, 1, 1] [2021-12-21 21:57:32,068 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2021-12-21 21:57:32,068 INFO L791 eck$LassoCheckResult]: Stem: 3358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3363#L18-1 assume !!(main_~i~0#1 > 0); 3389#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3385#L12-2 assume !(10 == main_~i~0#1); 3384#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3383#L18-1 assume !!(main_~i~0#1 > 0); 3382#L12 assume !(1 == main_~i~0#1); 3381#L12-2 assume !(10 == main_~i~0#1); 3380#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3379#L18-1 assume !!(main_~i~0#1 > 0); 3378#L12 assume !(1 == main_~i~0#1); 3377#L12-2 assume !(10 == main_~i~0#1); 3376#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3375#L18-1 assume !!(main_~i~0#1 > 0); 3372#L12 assume !(1 == main_~i~0#1); 3374#L12-2 assume !(10 == main_~i~0#1); 3373#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(main_~i~0#1 > 0); 3370#L12 assume !(1 == main_~i~0#1); 3369#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3360#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3361#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2021-12-21 21:57:32,068 INFO L793 eck$LassoCheckResult]: Loop: 3422#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3350#L12-2 assume !(10 == main_~i~0#1); 3351#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3354#L18-1 assume !!(main_~i~0#1 > 0); 3355#L12 assume !(1 == main_~i~0#1); 3421#L12-2 assume !(10 == main_~i~0#1); 3420#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3419#L18-1 assume !!(main_~i~0#1 > 0); 3418#L12 assume !(1 == main_~i~0#1); 3417#L12-2 assume !(10 == main_~i~0#1); 3416#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3415#L18-1 assume !!(main_~i~0#1 > 0); 3414#L12 assume !(1 == main_~i~0#1); 3413#L12-2 assume !(10 == main_~i~0#1); 3398#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3394#L18-1 assume !!(main_~i~0#1 > 0); 3387#L12 assume !(1 == main_~i~0#1); 3388#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3366#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3367#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2021-12-21 21:57:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 123757625, now seen corresponding path program 1 times [2021-12-21 21:57:32,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058674031] [2021-12-21 21:57:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:32,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058674031] [2021-12-21 21:57:32,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058674031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:32,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047372641] [2021-12-21 21:57:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:32,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,109 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-21 21:57:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047372641] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:32,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:32,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 21:57:32,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436281603] [2021-12-21 21:57:32,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:32,212 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2141599470, now seen corresponding path program 1 times [2021-12-21 21:57:32,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735658618] [2021-12-21 21:57:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735658618] [2021-12-21 21:57:32,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735658618] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753887271] [2021-12-21 21:57:32,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,238 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-12-21 21:57:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:32,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:32,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753887271] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:32,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:32,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-21 21:57:32,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323650712] [2021-12-21 21:57:32,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:32,358 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 21:57:32,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 21:57:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-12-21 21:57:32,358 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:32,399 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-21 21:57:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 21:57:32,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 180 transitions. [2021-12-21 21:57:32,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-12-21 21:57:32,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 147 states and 160 transitions. [2021-12-21 21:57:32,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-21 21:57:32,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-12-21 21:57:32,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 160 transitions. [2021-12-21 21:57:32,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:32,406 INFO L681 BuchiCegarLoop]: Abstraction has 147 states and 160 transitions. [2021-12-21 21:57:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 160 transitions. [2021-12-21 21:57:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2021-12-21 21:57:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2021-12-21 21:57:32,408 INFO L704 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-12-21 21:57:32,408 INFO L587 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-12-21 21:57:32,408 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-21 21:57:32,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 153 transitions. [2021-12-21 21:57:32,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-21 21:57:32,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:32,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:32,409 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 9, 1, 1, 1, 1, 1] [2021-12-21 21:57:32,409 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2021-12-21 21:57:32,409 INFO L791 eck$LassoCheckResult]: Stem: 3875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3879#L18-1 assume !!(main_~i~0#1 > 0); 3950#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3866#L12-2 assume !(10 == main_~i~0#1); 3867#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3882#L18-1 assume !!(main_~i~0#1 > 0); 3973#L12 assume !(1 == main_~i~0#1); 3972#L12-2 assume !(10 == main_~i~0#1); 3971#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3970#L18-1 assume !!(main_~i~0#1 > 0); 3969#L12 assume !(1 == main_~i~0#1); 3968#L12-2 assume !(10 == main_~i~0#1); 3967#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3966#L18-1 assume !!(main_~i~0#1 > 0); 3965#L12 assume !(1 == main_~i~0#1); 3964#L12-2 assume !(10 == main_~i~0#1); 3963#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3962#L18-1 assume !!(main_~i~0#1 > 0); 3961#L12 assume !(1 == main_~i~0#1); 3960#L12-2 assume !(10 == main_~i~0#1); 3959#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3958#L18-1 assume !!(main_~i~0#1 > 0); 3957#L12 assume !(1 == main_~i~0#1); 3956#L12-2 assume !(10 == main_~i~0#1); 3955#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3954#L18-1 assume !!(main_~i~0#1 > 0); 3953#L12 assume !(1 == main_~i~0#1); 3952#L12-2 assume !(10 == main_~i~0#1); 3951#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3948#L18-1 assume !!(main_~i~0#1 > 0); 3947#L12 assume !(1 == main_~i~0#1); 3944#L12-2 assume !(10 == main_~i~0#1); 3942#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3938#L18-1 assume !!(main_~i~0#1 > 0); 3889#L12 assume !(1 == main_~i~0#1); 3893#L12-2 assume !(10 == main_~i~0#1); 3890#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3888#L18-1 assume !!(main_~i~0#1 > 0); 3887#L12 assume !(1 == main_~i~0#1); 3886#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3877#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3878#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2021-12-21 21:57:32,409 INFO L793 eck$LassoCheckResult]: Loop: 3933#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3932#L12-2 assume !(10 == main_~i~0#1); 3931#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3930#L18-1 assume !!(main_~i~0#1 > 0); 3929#L12 assume !(1 == main_~i~0#1); 3928#L12-2 assume !(10 == main_~i~0#1); 3927#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3926#L18-1 assume !!(main_~i~0#1 > 0); 3925#L12 assume !(1 == main_~i~0#1); 3924#L12-2 assume !(10 == main_~i~0#1); 3923#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3922#L18-1 assume !!(main_~i~0#1 > 0); 3921#L12 assume !(1 == main_~i~0#1); 3920#L12-2 assume !(10 == main_~i~0#1); 3919#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3918#L18-1 assume !!(main_~i~0#1 > 0); 3917#L12 assume !(1 == main_~i~0#1); 3916#L12-2 assume !(10 == main_~i~0#1); 3915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3914#L18-1 assume !!(main_~i~0#1 > 0); 3913#L12 assume !(1 == main_~i~0#1); 3912#L12-2 assume !(10 == main_~i~0#1); 3911#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3910#L18-1 assume !!(main_~i~0#1 > 0); 3909#L12 assume !(1 == main_~i~0#1); 3908#L12-2 assume !(10 == main_~i~0#1); 3907#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3906#L18-1 assume !!(main_~i~0#1 > 0); 3905#L12 assume !(1 == main_~i~0#1); 3904#L12-2 assume !(10 == main_~i~0#1); 3903#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3902#L18-1 assume !!(main_~i~0#1 > 0); 3901#L12 assume !(1 == main_~i~0#1); 3900#L12-2 assume !(10 == main_~i~0#1); 3898#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3894#L18-1 assume !!(main_~i~0#1 > 0); 3891#L12 assume !(1 == main_~i~0#1); 3892#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3883#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3884#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2021-12-21 21:57:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -273593524, now seen corresponding path program 2 times [2021-12-21 21:57:32,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:32,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135970108] [2021-12-21 21:57:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:32,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:32,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1615279707, now seen corresponding path program 2 times [2021-12-21 21:57:32,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:32,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674861872] [2021-12-21 21:57:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:32,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:32,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1777315312, now seen corresponding path program 3 times [2021-12-21 21:57:32,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:32,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837663272] [2021-12-21 21:57:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:32,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-12-21 21:57:32,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837663272] [2021-12-21 21:57:32,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837663272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:32,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:32,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 21:57:32,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897119965] [2021-12-21 21:57:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:32,558 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:32,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:32,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:32,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:32,559 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:32,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:32,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:32,559 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2021-12-21 21:57:32,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:32,559 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:32,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,591 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:32,591 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:32,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,592 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:32,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:32,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-21 21:57:32,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-21 21:57:32,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,631 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-21 21:57:32,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:32,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:32,639 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:32,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:32,654 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:32,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:32,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:32,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:32,654 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:32,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:32,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:32,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2021-12-21 21:57:32,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:32,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:32,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:32,687 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:32,687 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:32,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,688 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-21 21:57:32,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:32,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:32,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:32,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:32,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:32,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:32,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:32,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:32,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:32,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,727 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-21 21:57:32,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:32,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:32,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:32,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:32,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:32,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:32,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:32,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:32,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:32,752 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:32,752 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:32,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:32,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:32,753 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:32,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:32,755 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:32,755 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:32,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-21 21:57:32,755 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2021-12-21 21:57:32,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:32,770 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:32,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 21:57:32,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:32,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-21 21:57:32,954 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:32,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 226 states and 242 transitions. Complement of second has 7 states. [2021-12-21 21:57:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-21 21:57:32,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 43 letters. Loop has 40 letters. [2021-12-21 21:57:32,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:32,995 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:33,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:33,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:33,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 21:57:33,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:33,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-21 21:57:33,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:33,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 313 states and 335 transitions. Complement of second has 11 states. [2021-12-21 21:57:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-21 21:57:33,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 40 letters. [2021-12-21 21:57:33,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:33,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 83 letters. Loop has 40 letters. [2021-12-21 21:57:33,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:33,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 80 letters. [2021-12-21 21:57:33,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:33,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 335 transitions. [2021-12-21 21:57:33,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2021-12-21 21:57:33,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 265 states and 285 transitions. [2021-12-21 21:57:33,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2021-12-21 21:57:33,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-12-21 21:57:33,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 285 transitions. [2021-12-21 21:57:33,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:33,194 INFO L681 BuchiCegarLoop]: Abstraction has 265 states and 285 transitions. [2021-12-21 21:57:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 285 transitions. [2021-12-21 21:57:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 221. [2021-12-21 21:57:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.0769230769230769) internal successors, (238), 220 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 238 transitions. [2021-12-21 21:57:33,196 INFO L704 BuchiCegarLoop]: Abstraction has 221 states and 238 transitions. [2021-12-21 21:57:33,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 21:57:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 21:57:33,197 INFO L87 Difference]: Start difference. First operand 221 states and 238 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:33,216 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2021-12-21 21:57:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 21:57:33,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 207 transitions. [2021-12-21 21:57:33,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-21 21:57:33,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 189 states and 203 transitions. [2021-12-21 21:57:33,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2021-12-21 21:57:33,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-12-21 21:57:33,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 203 transitions. [2021-12-21 21:57:33,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:33,218 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 203 transitions. [2021-12-21 21:57:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 203 transitions. [2021-12-21 21:57:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2021-12-21 21:57:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 1.0670391061452513) internal successors, (191), 178 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2021-12-21 21:57:33,220 INFO L704 BuchiCegarLoop]: Abstraction has 179 states and 191 transitions. [2021-12-21 21:57:33,220 INFO L587 BuchiCegarLoop]: Abstraction has 179 states and 191 transitions. [2021-12-21 21:57:33,220 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-21 21:57:33,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 191 transitions. [2021-12-21 21:57:33,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2021-12-21 21:57:33,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:33,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:33,222 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2021-12-21 21:57:33,222 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2021-12-21 21:57:33,223 INFO L791 eck$LassoCheckResult]: Stem: 5511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5515#L18-1 assume !!(main_~i~0#1 > 0); 5565#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5505#L12-2 assume !(10 == main_~i~0#1); 5506#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5509#L18-1 assume !!(main_~i~0#1 > 0); 5510#L12 assume !(1 == main_~i~0#1); 5518#L12-2 assume !(10 == main_~i~0#1); 5681#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5680#L18-1 assume !!(main_~i~0#1 > 0); 5679#L12 assume !(1 == main_~i~0#1); 5678#L12-2 assume !(10 == main_~i~0#1); 5677#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5676#L18-1 assume !!(main_~i~0#1 > 0); 5675#L12 assume !(1 == main_~i~0#1); 5674#L12-2 assume !(10 == main_~i~0#1); 5673#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5672#L18-1 assume !!(main_~i~0#1 > 0); 5671#L12 assume !(1 == main_~i~0#1); 5670#L12-2 assume !(10 == main_~i~0#1); 5669#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5668#L18-1 assume !!(main_~i~0#1 > 0); 5667#L12 assume !(1 == main_~i~0#1); 5666#L12-2 assume !(10 == main_~i~0#1); 5665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5664#L18-1 assume !!(main_~i~0#1 > 0); 5663#L12 assume !(1 == main_~i~0#1); 5662#L12-2 assume !(10 == main_~i~0#1); 5661#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5660#L18-1 assume !!(main_~i~0#1 > 0); 5659#L12 assume !(1 == main_~i~0#1); 5658#L12-2 assume !(10 == main_~i~0#1); 5657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5656#L18-1 assume !!(main_~i~0#1 > 0); 5653#L12 assume !(1 == main_~i~0#1); 5655#L12-2 assume !(10 == main_~i~0#1); 5654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5652#L18-1 assume !!(main_~i~0#1 > 0); 5651#L12 assume !(1 == main_~i~0#1); 5650#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5648#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5514#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2021-12-21 21:57:33,224 INFO L793 eck$LassoCheckResult]: Loop: 5636#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5503#L12-2 assume !(10 == main_~i~0#1); 5504#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5630#L18-1 assume !!(main_~i~0#1 > 0); 5628#L12 assume !(1 == main_~i~0#1); 5626#L12-2 assume !(10 == main_~i~0#1); 5624#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5622#L18-1 assume !!(main_~i~0#1 > 0); 5620#L12 assume !(1 == main_~i~0#1); 5618#L12-2 assume !(10 == main_~i~0#1); 5616#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5614#L18-1 assume !!(main_~i~0#1 > 0); 5612#L12 assume !(1 == main_~i~0#1); 5610#L12-2 assume !(10 == main_~i~0#1); 5608#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5606#L18-1 assume !!(main_~i~0#1 > 0); 5604#L12 assume !(1 == main_~i~0#1); 5602#L12-2 assume !(10 == main_~i~0#1); 5600#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5598#L18-1 assume !!(main_~i~0#1 > 0); 5596#L12 assume !(1 == main_~i~0#1); 5594#L12-2 assume !(10 == main_~i~0#1); 5592#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5590#L18-1 assume !!(main_~i~0#1 > 0); 5588#L12 assume !(1 == main_~i~0#1); 5586#L12-2 assume !(10 == main_~i~0#1); 5584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5582#L18-1 assume !!(main_~i~0#1 > 0); 5581#L12 assume !(1 == main_~i~0#1); 5580#L12-2 assume !(10 == main_~i~0#1); 5579#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5578#L18-1 assume !!(main_~i~0#1 > 0); 5577#L12 assume !(1 == main_~i~0#1); 5575#L12-2 assume !(10 == main_~i~0#1); 5573#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5569#L18-1 assume !!(main_~i~0#1 > 0); 5567#L12 assume !(1 == main_~i~0#1); 5568#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5521#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5507#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2021-12-21 21:57:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 4 times [2021-12-21 21:57:33,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:33,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059484370] [2021-12-21 21:57:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:33,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:33,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:33,243 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 3 times [2021-12-21 21:57:33,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956609379] [2021-12-21 21:57:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:33,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:33,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:33,265 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 5 times [2021-12-21 21:57:33,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:33,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011805026] [2021-12-21 21:57:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:33,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-21 21:57:33,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011805026] [2021-12-21 21:57:33,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011805026] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001027110] [2021-12-21 21:57:33,292 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 21:57:33,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,293 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-12-21 21:57:33,314 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-21 21:57:33,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:33,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:33,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-21 21:57:33,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-21 21:57:33,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001027110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:33,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:33,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-21 21:57:33,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651033706] [2021-12-21 21:57:33,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:33,636 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:33,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:33,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:33,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:33,637 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:33,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:33,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:33,637 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2021-12-21 21:57:33,637 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:33,637 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:33,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,670 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:33,671 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:33,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,672 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-21 21:57:33,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:33,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:33,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:33,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:33,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:33,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,697 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-21 21:57:33,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:33,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:33,704 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:33,705 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:33,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-21 21:57:33,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,720 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-21 21:57:33,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:33,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:33,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:33,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,742 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-21 21:57:33,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:33,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:33,797 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:33,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:33,799 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:33,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:33,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:33,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:33,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:33,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:33,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:33,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2021-12-21 21:57:33,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:33,800 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:33,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:33,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:33,832 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:33,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,833 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-21 21:57:33,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:33,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:33,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:33,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:33,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:33,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:33,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:33,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:33,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-21 21:57:33,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,856 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-21 21:57:33,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:33,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:33,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:33,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:33,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:33,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:33,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:33,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:33,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:33,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:33,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,879 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-21 21:57:33,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:33,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:33,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:33,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:33,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:33,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:33,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:33,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:33,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-21 21:57:33,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,910 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-21 21:57:33,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:33,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:33,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:33,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:33,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:33,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:33,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:33,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:33,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:33,921 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:33,921 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:33,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:33,923 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:33,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-21 21:57:33,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:33,924 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:33,924 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:33,924 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2021-12-21 21:57:33,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-21 21:57:33,938 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:33,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:33,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:34,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-21 21:57:34,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 228 states and 242 transitions. Complement of second has 7 states. [2021-12-21 21:57:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-21 21:57:34,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-21 21:57:34,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:34,193 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-21 21:57:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:34,409 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-21 21:57:34,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 238 states and 253 transitions. Complement of second has 11 states. [2021-12-21 21:57:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-21 21:57:34,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-21 21:57:34,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:34,446 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:34,645 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 5 loop predicates [2021-12-21 21:57:34,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 342 states and 359 transitions. Complement of second has 9 states. [2021-12-21 21:57:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-21 21:57:34,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-21 21:57:34,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:34,668 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:34,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-21 21:57:34,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 490 states and 514 transitions. Complement of second has 19 states. [2021-12-21 21:57:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2021-12-21 21:57:34,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-21 21:57:34,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:34,919 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:34,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:34,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:35,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:35,128 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-21 21:57:35,128 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:35,268 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 2294 states and 2963 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2021-12-21 21:57:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2021-12-21 21:57:35,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-21 21:57:35,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:35,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2021-12-21 21:57:35,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:35,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2021-12-21 21:57:35,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:35,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2294 states and 2963 transitions. [2021-12-21 21:57:35,287 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2021-12-21 21:57:35,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2294 states to 1175 states and 1510 transitions. [2021-12-21 21:57:35,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2021-12-21 21:57:35,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2021-12-21 21:57:35,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1175 states and 1510 transitions. [2021-12-21 21:57:35,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:35,291 INFO L681 BuchiCegarLoop]: Abstraction has 1175 states and 1510 transitions. [2021-12-21 21:57:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states and 1510 transitions. [2021-12-21 21:57:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 674. [2021-12-21 21:57:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.3902077151335313) internal successors, (937), 673 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 937 transitions. [2021-12-21 21:57:35,299 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 937 transitions. [2021-12-21 21:57:35,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 21:57:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-21 21:57:35,299 INFO L87 Difference]: Start difference. First operand 674 states and 937 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:35,325 INFO L93 Difference]: Finished difference Result 802 states and 1128 transitions. [2021-12-21 21:57:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 21:57:35,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 1128 transitions. [2021-12-21 21:57:35,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2021-12-21 21:57:35,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 785 states and 1104 transitions. [2021-12-21 21:57:35,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-12-21 21:57:35,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-12-21 21:57:35,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1104 transitions. [2021-12-21 21:57:35,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:35,332 INFO L681 BuchiCegarLoop]: Abstraction has 785 states and 1104 transitions. [2021-12-21 21:57:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1104 transitions. [2021-12-21 21:57:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 744. [2021-12-21 21:57:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 744 states have (on average 1.4045698924731183) internal successors, (1045), 743 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1045 transitions. [2021-12-21 21:57:35,338 INFO L704 BuchiCegarLoop]: Abstraction has 744 states and 1045 transitions. [2021-12-21 21:57:35,338 INFO L587 BuchiCegarLoop]: Abstraction has 744 states and 1045 transitions. [2021-12-21 21:57:35,338 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-21 21:57:35,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 744 states and 1045 transitions. [2021-12-21 21:57:35,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2021-12-21 21:57:35,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:35,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:35,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2021-12-21 21:57:35,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2021-12-21 21:57:35,341 INFO L791 eck$LassoCheckResult]: Stem: 12934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 12939#L18-1 assume !!(main_~i~0#1 > 0); 13270#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13120#L12-2 assume !(10 == main_~i~0#1); 13258#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13256#L18-1 assume !!(main_~i~0#1 > 0); 13254#L12 assume !(1 == main_~i~0#1); 13252#L12-2 assume !(10 == main_~i~0#1); 13250#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13248#L18-1 assume !!(main_~i~0#1 > 0); 13246#L12 assume !(1 == main_~i~0#1); 13244#L12-2 assume !(10 == main_~i~0#1); 13242#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13240#L18-1 assume !!(main_~i~0#1 > 0); 13238#L12 assume !(1 == main_~i~0#1); 13236#L12-2 assume !(10 == main_~i~0#1); 13234#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13232#L18-1 assume !!(main_~i~0#1 > 0); 13230#L12 assume !(1 == main_~i~0#1); 13228#L12-2 assume !(10 == main_~i~0#1); 13226#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13224#L18-1 assume !!(main_~i~0#1 > 0); 13222#L12 assume !(1 == main_~i~0#1); 13220#L12-2 assume !(10 == main_~i~0#1); 13218#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13216#L18-1 assume !!(main_~i~0#1 > 0); 13214#L12 assume !(1 == main_~i~0#1); 13212#L12-2 assume !(10 == main_~i~0#1); 13210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13208#L18-1 assume !!(main_~i~0#1 > 0); 13206#L12 assume !(1 == main_~i~0#1); 13204#L12-2 assume !(10 == main_~i~0#1); 13203#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13202#L18-1 assume !!(main_~i~0#1 > 0); 13190#L12 assume !(1 == main_~i~0#1); 13198#L12-2 assume !(10 == main_~i~0#1); 13194#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13189#L18-1 assume !!(main_~i~0#1 > 0); 13188#L12 assume !(1 == main_~i~0#1); 13187#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13146#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13185#L18-1 assume !!(main_~i~0#1 > 0); 13184#L12 assume !(1 == main_~i~0#1); 13183#L12-2 assume !(10 == main_~i~0#1); 13181#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13180#L18-1 assume !!(main_~i~0#1 > 0); 13179#L12 assume !(1 == main_~i~0#1); 13178#L12-2 assume !(10 == main_~i~0#1); 13176#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13175#L18-1 assume !!(main_~i~0#1 > 0); 13174#L12 assume !(1 == main_~i~0#1); 13173#L12-2 assume !(10 == main_~i~0#1); 13171#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13170#L18-1 assume !!(main_~i~0#1 > 0); 13169#L12 assume !(1 == main_~i~0#1); 13168#L12-2 assume !(10 == main_~i~0#1); 13166#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13165#L18-1 assume !!(main_~i~0#1 > 0); 13118#L12 assume !(1 == main_~i~0#1); 13145#L12-2 assume !(10 == main_~i~0#1); 13121#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13122#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2021-12-21 21:57:35,341 INFO L793 eck$LassoCheckResult]: Loop: 13266#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13265#L12-2 assume !(10 == main_~i~0#1); 12946#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 12930#L18-1 assume !!(main_~i~0#1 > 0); 12931#L12 assume !(1 == main_~i~0#1); 12941#L12-2 assume !(10 == main_~i~0#1); 13665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13663#L18-1 assume !!(main_~i~0#1 > 0); 13661#L12 assume !(1 == main_~i~0#1); 13659#L12-2 assume !(10 == main_~i~0#1); 13657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13655#L18-1 assume !!(main_~i~0#1 > 0); 13653#L12 assume !(1 == main_~i~0#1); 13651#L12-2 assume !(10 == main_~i~0#1); 13649#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13647#L18-1 assume !!(main_~i~0#1 > 0); 13645#L12 assume !(1 == main_~i~0#1); 13643#L12-2 assume !(10 == main_~i~0#1); 13641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13639#L18-1 assume !!(main_~i~0#1 > 0); 13637#L12 assume !(1 == main_~i~0#1); 13635#L12-2 assume !(10 == main_~i~0#1); 13633#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13631#L18-1 assume !!(main_~i~0#1 > 0); 13629#L12 assume !(1 == main_~i~0#1); 13627#L12-2 assume !(10 == main_~i~0#1); 13625#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13623#L18-1 assume !!(main_~i~0#1 > 0); 13621#L12 assume !(1 == main_~i~0#1); 13619#L12-2 assume !(10 == main_~i~0#1); 13617#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13615#L18-1 assume !!(main_~i~0#1 > 0); 13614#L12 assume !(1 == main_~i~0#1); 13613#L12-2 assume !(10 == main_~i~0#1); 13609#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13610#L18-1 assume !!(main_~i~0#1 > 0); 13586#L12 assume !(1 == main_~i~0#1); 13587#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13429#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13510#L18-1 assume !!(main_~i~0#1 > 0); 13506#L12 assume !(1 == main_~i~0#1); 13503#L12-2 assume !(10 == main_~i~0#1); 13496#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13493#L18-1 assume !!(main_~i~0#1 > 0); 13491#L12 assume !(1 == main_~i~0#1); 13490#L12-2 assume !(10 == main_~i~0#1); 13489#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13488#L18-1 assume !!(main_~i~0#1 > 0); 13486#L12 assume !(1 == main_~i~0#1); 13445#L12-2 assume !(10 == main_~i~0#1); 13446#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13487#L18-1 assume !!(main_~i~0#1 > 0); 13484#L12 assume !(1 == main_~i~0#1); 13450#L12-2 assume !(10 == main_~i~0#1); 13448#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13449#L18-1 assume !!(main_~i~0#1 > 0); 13434#L12 assume !(1 == main_~i~0#1); 13430#L12-2 assume !(10 == main_~i~0#1); 13272#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13273#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2021-12-21 21:57:35,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 6 times [2021-12-21 21:57:35,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:35,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746671608] [2021-12-21 21:57:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:35,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:35,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:35,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:35,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 4 times [2021-12-21 21:57:35,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:35,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988629155] [2021-12-21 21:57:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:35,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:35,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:35,377 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 7 times [2021-12-21 21:57:35,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91836896] [2021-12-21 21:57:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:35,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-21 21:57:35,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:35,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91836896] [2021-12-21 21:57:35,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91836896] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:35,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481001603] [2021-12-21 21:57:35,451 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 21:57:35,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:35,452 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:35,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-21 21:57:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:35,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 21:57:35,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-21 21:57:35,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-21 21:57:35,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481001603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:35,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:35,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2021-12-21 21:57:35,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398578506] [2021-12-21 21:57:35,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:35,918 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:35,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:35,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:35,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:35,919 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:35,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:35,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:35,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:35,919 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2021-12-21 21:57:35,919 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:35,919 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:35,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:35,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:35,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:35,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:35,953 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:35,954 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:35,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:35,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:35,980 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:35,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-21 21:57:35,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:35,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:36,004 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:36,004 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:36,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-21 21:57:36,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:36,025 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:36,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-21 21:57:36,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:36,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:36,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:36,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:36,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:36,063 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:36,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:36,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:36,073 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:36,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-21 21:57:36,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-12-21 21:57:36,087 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:36,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:36,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:36,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:36,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:36,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:36,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:36,087 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:36,087 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2021-12-21 21:57:36,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:36,087 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:36,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:36,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:36,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:36,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:36,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:36,131 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:36,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:36,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:36,134 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:36,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-21 21:57:36,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:36,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:36,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:36,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:36,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:36,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:36,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:36,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:36,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:36,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:36,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:36,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:36,144 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:36,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-21 21:57:36,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:36,146 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:36,146 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:36,146 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2021-12-21 21:57:36,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:36,161 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:36,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:36,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:36,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 21:57:36,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:36,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-21 21:57:36,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:36,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1013 states and 1361 transitions. Complement of second has 7 states. [2021-12-21 21:57:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-21 21:57:36,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-21 21:57:36,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:36,502 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:36,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:36,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 21:57:36,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:36,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:36,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-21 21:57:36,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:36,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1057 states and 1423 transitions. Complement of second has 11 states. [2021-12-21 21:57:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-21 21:57:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-21 21:57:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:36,894 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:36,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:36,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:37,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 21:57:37,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:37,196 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 9 loop predicates [2021-12-21 21:57:37,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:37,228 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1553 states and 2121 transitions. Complement of second has 9 states. [2021-12-21 21:57:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-21 21:57:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-21 21:57:37,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:37,230 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:37,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:37,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:37,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 21:57:37,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:37,533 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-21 21:57:37,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:37,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 2220 states and 3011 transitions. Complement of second has 19 states. [2021-12-21 21:57:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2021-12-21 21:57:37,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-21 21:57:37,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:37,591 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:37,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:37,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:37,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 21:57:37,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 21:57:37,905 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-21 21:57:37,905 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:38,242 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 12508 states and 21932 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2021-12-21 21:57:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2021-12-21 21:57:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2021-12-21 21:57:38,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-21 21:57:38,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:38,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2021-12-21 21:57:38,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:38,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2021-12-21 21:57:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:38,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12508 states and 21932 transitions. [2021-12-21 21:57:38,318 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2021-12-21 21:57:38,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12508 states to 5535 states and 9788 transitions. [2021-12-21 21:57:38,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2021-12-21 21:57:38,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2021-12-21 21:57:38,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5535 states and 9788 transitions. [2021-12-21 21:57:38,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:38,341 INFO L681 BuchiCegarLoop]: Abstraction has 5535 states and 9788 transitions. [2021-12-21 21:57:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states and 9788 transitions. [2021-12-21 21:57:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 3406. [2021-12-21 21:57:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3406 states have (on average 1.8094539048737521) internal successors, (6163), 3405 states have internal predecessors, (6163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 6163 transitions. [2021-12-21 21:57:38,385 INFO L704 BuchiCegarLoop]: Abstraction has 3406 states and 6163 transitions. [2021-12-21 21:57:38,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 21:57:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-12-21 21:57:38,386 INFO L87 Difference]: Start difference. First operand 3406 states and 6163 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:38,426 INFO L93 Difference]: Finished difference Result 3793 states and 7008 transitions. [2021-12-21 21:57:38,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 21:57:38,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3793 states and 7008 transitions. [2021-12-21 21:57:38,457 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2021-12-21 21:57:38,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3793 states to 3761 states and 6917 transitions. [2021-12-21 21:57:38,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2021-12-21 21:57:38,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2021-12-21 21:57:38,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3761 states and 6917 transitions. [2021-12-21 21:57:38,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:38,471 INFO L681 BuchiCegarLoop]: Abstraction has 3761 states and 6917 transitions. [2021-12-21 21:57:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states and 6917 transitions. [2021-12-21 21:57:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3614. [2021-12-21 21:57:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3614 states have (on average 1.832595462091865) internal successors, (6623), 3613 states have internal predecessors, (6623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6623 transitions. [2021-12-21 21:57:38,514 INFO L704 BuchiCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2021-12-21 21:57:38,514 INFO L587 BuchiCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2021-12-21 21:57:38,515 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-21 21:57:38,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3614 states and 6623 transitions. [2021-12-21 21:57:38,524 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2021-12-21 21:57:38,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:38,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:38,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2021-12-21 21:57:38,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2021-12-21 21:57:38,526 INFO L791 eck$LassoCheckResult]: Stem: 42219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 42223#L18-1 assume !!(main_~i~0#1 > 0); 42475#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 43049#L12-2 assume !(10 == main_~i~0#1); 44280#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44278#L18-1 assume !!(main_~i~0#1 > 0); 44276#L12 assume !(1 == main_~i~0#1); 44274#L12-2 assume !(10 == main_~i~0#1); 44272#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44270#L18-1 assume !!(main_~i~0#1 > 0); 44268#L12 assume !(1 == main_~i~0#1); 44266#L12-2 assume !(10 == main_~i~0#1); 44264#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44262#L18-1 assume !!(main_~i~0#1 > 0); 44260#L12 assume !(1 == main_~i~0#1); 44258#L12-2 assume !(10 == main_~i~0#1); 44256#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44254#L18-1 assume !!(main_~i~0#1 > 0); 44252#L12 assume !(1 == main_~i~0#1); 44250#L12-2 assume !(10 == main_~i~0#1); 44248#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44246#L18-1 assume !!(main_~i~0#1 > 0); 44244#L12 assume !(1 == main_~i~0#1); 44242#L12-2 assume !(10 == main_~i~0#1); 44240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44238#L18-1 assume !!(main_~i~0#1 > 0); 44236#L12 assume !(1 == main_~i~0#1); 44234#L12-2 assume !(10 == main_~i~0#1); 44232#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44230#L18-1 assume !!(main_~i~0#1 > 0); 44228#L12 assume !(1 == main_~i~0#1); 44226#L12-2 assume !(10 == main_~i~0#1); 44224#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44222#L18-1 assume !!(main_~i~0#1 > 0); 44219#L12 assume !(1 == main_~i~0#1); 44220#L12-2 assume !(10 == main_~i~0#1); 44213#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44214#L18-1 assume !!(main_~i~0#1 > 0); 43809#L12 assume !(1 == main_~i~0#1); 43810#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 43752#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43805#L18-1 assume !!(main_~i~0#1 > 0); 43806#L12 assume !(1 == main_~i~0#1); 43801#L12-2 assume !(10 == main_~i~0#1); 43802#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43796#L18-1 assume !!(main_~i~0#1 > 0); 43797#L12 assume !(1 == main_~i~0#1); 44090#L12-2 assume !(10 == main_~i~0#1); 44088#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44087#L18-1 assume !!(main_~i~0#1 > 0); 44086#L12 assume !(1 == main_~i~0#1); 43783#L12-2 assume !(10 == main_~i~0#1); 43784#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44081#L18-1 assume !!(main_~i~0#1 > 0); 45435#L12 assume !(1 == main_~i~0#1); 45431#L12-2 assume !(10 == main_~i~0#1); 45426#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44073#L18-1 assume !!(main_~i~0#1 > 0); 45389#L12 assume !(1 == main_~i~0#1); 45390#L12-2 assume !(10 == main_~i~0#1); 45485#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44067#L18-1 assume !!(main_~i~0#1 > 0); 45499#L12 assume !(1 == main_~i~0#1); 45498#L12-2 assume !(10 == main_~i~0#1); 45488#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45496#L18-1 assume !!(main_~i~0#1 > 0); 45493#L12 assume !(1 == main_~i~0#1); 45491#L12-2 assume !(10 == main_~i~0#1); 45490#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44195#L18-1 assume !!(main_~i~0#1 > 0); 42948#L12 assume !(1 == main_~i~0#1); 44297#L12-2 assume !(10 == main_~i~0#1); 45482#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 42947#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2021-12-21 21:57:38,526 INFO L793 eck$LassoCheckResult]: Loop: 42946#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 42945#L12-2 assume !(10 == main_~i~0#1); 43888#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 42216#L18-1 assume !!(main_~i~0#1 > 0); 42217#L12 assume !(1 == main_~i~0#1); 42225#L12-2 assume !(10 == main_~i~0#1); 45821#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45819#L18-1 assume !!(main_~i~0#1 > 0); 45817#L12 assume !(1 == main_~i~0#1); 45815#L12-2 assume !(10 == main_~i~0#1); 45813#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45811#L18-1 assume !!(main_~i~0#1 > 0); 45809#L12 assume !(1 == main_~i~0#1); 45807#L12-2 assume !(10 == main_~i~0#1); 45805#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45803#L18-1 assume !!(main_~i~0#1 > 0); 45801#L12 assume !(1 == main_~i~0#1); 45799#L12-2 assume !(10 == main_~i~0#1); 45797#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45795#L18-1 assume !!(main_~i~0#1 > 0); 45793#L12 assume !(1 == main_~i~0#1); 45791#L12-2 assume !(10 == main_~i~0#1); 45789#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45787#L18-1 assume !!(main_~i~0#1 > 0); 45785#L12 assume !(1 == main_~i~0#1); 45783#L12-2 assume !(10 == main_~i~0#1); 45781#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45779#L18-1 assume !!(main_~i~0#1 > 0); 45777#L12 assume !(1 == main_~i~0#1); 45775#L12-2 assume !(10 == main_~i~0#1); 45773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45771#L18-1 assume !!(main_~i~0#1 > 0); 45769#L12 assume !(1 == main_~i~0#1); 45763#L12-2 assume !(10 == main_~i~0#1); 45762#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45761#L18-1 assume !!(main_~i~0#1 > 0); 45725#L12 assume !(1 == main_~i~0#1); 45726#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 44284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45516#L18-1 assume !!(main_~i~0#1 > 0); 45479#L12 assume !(1 == main_~i~0#1); 45478#L12-2 assume !(10 == main_~i~0#1); 45476#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45472#L18-1 assume !!(main_~i~0#1 > 0); 45468#L12 assume !(1 == main_~i~0#1); 45465#L12-2 assume !(10 == main_~i~0#1); 45463#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45458#L18-1 assume !!(main_~i~0#1 > 0); 45459#L12 assume !(1 == main_~i~0#1); 45505#L12-2 assume !(10 == main_~i~0#1); 45449#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45450#L18-1 assume !!(main_~i~0#1 > 0); 45495#L12 assume !(1 == main_~i~0#1); 45440#L12-2 assume !(10 == main_~i~0#1); 45428#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45427#L18-1 assume !!(main_~i~0#1 > 0); 45396#L12 assume !(1 == main_~i~0#1); 45354#L12-2 assume !(10 == main_~i~0#1); 45348#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45344#L18-1 assume !!(main_~i~0#1 > 0); 45345#L12 assume !(1 == main_~i~0#1); 45341#L12-2 assume !(10 == main_~i~0#1); 45339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45336#L18-1 assume !!(main_~i~0#1 > 0); 44368#L12 assume !(1 == main_~i~0#1); 44307#L12-2 assume !(10 == main_~i~0#1); 44308#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44323#L18-1 assume !!(main_~i~0#1 > 0); 43934#L12 assume !(1 == main_~i~0#1); 44288#L12-2 assume !(10 == main_~i~0#1); 43293#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43294#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2021-12-21 21:57:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 8 times [2021-12-21 21:57:38,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:38,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240622117] [2021-12-21 21:57:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:38,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 5 times [2021-12-21 21:57:38,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889867845] [2021-12-21 21:57:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:38,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 9 times [2021-12-21 21:57:38,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:38,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572316165] [2021-12-21 21:57:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:38,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:38,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:39,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 09:57:39 BoogieIcfgContainer [2021-12-21 21:57:39,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 21:57:39,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 21:57:39,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 21:57:39,038 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 21:57:39,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:27" (3/4) ... [2021-12-21 21:57:39,040 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 21:57:39,070 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 21:57:39,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 21:57:39,071 INFO L158 Benchmark]: Toolchain (without parser) took 11460.00ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 62.7MB in the beginning and 79.3MB in the end (delta: -16.6MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2021-12-21 21:57:39,071 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 94.4MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:57:39,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.56ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 72.3MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 21:57:39,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.36ms. Allocated memory is still 94.4MB. Free memory was 72.3MB in the beginning and 71.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:57:39,072 INFO L158 Benchmark]: Boogie Preprocessor took 10.14ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 70.3MB in the end (delta: 814.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:57:39,072 INFO L158 Benchmark]: RCFGBuilder took 163.88ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 62.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 21:57:39,072 INFO L158 Benchmark]: BuchiAutomizer took 11059.54ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 61.9MB in the beginning and 83.5MB in the end (delta: -21.7MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2021-12-21 21:57:39,073 INFO L158 Benchmark]: Witness Printer took 32.76ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 21:57:39,074 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.09ms. Allocated memory is still 94.4MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.56ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 72.3MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.36ms. Allocated memory is still 94.4MB. Free memory was 72.3MB in the beginning and 71.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.14ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 70.3MB in the end (delta: 814.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 163.88ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 62.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11059.54ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 61.9MB in the beginning and 83.5MB in the end (delta: -21.7MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Witness Printer took 32.76ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 6 deterministic, 3 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 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. 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 -1 * i + 5 and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * i + 5 and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3614 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 5.8s. Construction of modules took 0.3s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 3069 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 3614 states and ocurred in iteration 12. Nontrivial modules had stage [5, 1, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 741/820 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 207 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI1 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax168 hnf100 lsp46 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq190 hnf93 smp92 dnf133 smp95 tf107 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: 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=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@188900cc=0, up=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 21:57:39,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2021-12-21 21:57:39,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-12-21 21:57:39,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:39,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-12-21 21:57:39,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:40,117 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)