./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/DivMinus2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/DivMinus2.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 4113f10404cd50c48db8fb998633f502f8a0b01a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:29:45,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:45,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:45,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:45,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:45,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:45,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:45,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:45,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:45,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:45,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:45,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:45,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:45,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:45,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:45,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:45,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:45,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:45,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:45,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:45,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:45,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:45,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:45,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:45,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:45,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:45,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:45,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:45,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:45,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:45,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:45,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:45,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:45,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:45,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:45,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:45,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:45,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:45,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:45,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:45,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:45,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:45,217 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:45,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:45,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:45,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:45,221 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:45,221 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:45,221 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:45,222 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:45,222 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:45,222 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:45,223 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:45,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:45,224 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:45,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:45,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:45,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:45,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:45,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:45,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:45,227 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:45,227 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:45,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:45,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:45,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:45,228 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:45,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:45,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:45,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:45,230 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:45,232 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:45,232 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 4113f10404cd50c48db8fb998633f502f8a0b01a [2020-07-29 01:29:45,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:45,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:45,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:45,577 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:45,577 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:45,578 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/DivMinus2.c [2020-07-29 01:29:45,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b472285f/27392dc120374a2da7b69cd0e1805e0d/FLAGb23dc8b45 [2020-07-29 01:29:46,128 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:46,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/DivMinus2.c [2020-07-29 01:29:46,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b472285f/27392dc120374a2da7b69cd0e1805e0d/FLAGb23dc8b45 [2020-07-29 01:29:46,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b472285f/27392dc120374a2da7b69cd0e1805e0d [2020-07-29 01:29:46,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:46,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:46,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:46,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:46,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:46,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa24b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46, skipping insertion in model container [2020-07-29 01:29:46,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:46,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:46,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:46,826 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:46,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:46,867 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:46,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46 WrapperNode [2020-07-29 01:29:46,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:46,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:46,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:46,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:46,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:46,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:46,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:46,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:46,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:46,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:47,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:47,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... [2020-07-29 01:29:47,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:47,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:47,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:47,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:47,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:47,294 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:47,294 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:29:47,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:47 BoogieIcfgContainer [2020-07-29 01:29:47,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:47,303 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:47,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:47,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:47,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:47,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:46" (1/3) ... [2020-07-29 01:29:47,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36dec3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:47, skipping insertion in model container [2020-07-29 01:29:47,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:47,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:46" (2/3) ... [2020-07-29 01:29:47,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36dec3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:47, skipping insertion in model container [2020-07-29 01:29:47,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:47,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:47" (3/3) ... [2020-07-29 01:29:47,320 INFO L371 chiAutomizerObserver]: Analyzing ICFG DivMinus2.c [2020-07-29 01:29:47,377 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:47,377 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:47,377 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:47,377 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:47,378 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:47,378 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:47,378 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:47,378 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:47,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:47,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:47,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:47,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:47,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:47,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:47,439 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:47,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:47,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:47,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:47,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:47,444 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:47,444 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:47,455 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 7#L14-2true [2020-07-29 01:29:47,455 INFO L796 eck$LassoCheckResult]: Loop: 7#L14-2true assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 3#L17-2true assume !(0 != main_~ytmp~0); 11#L16-2true main_~res~0 := 1 + main_~res~0; 7#L14-2true [2020-07-29 01:29:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:29:47,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:47,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171072822] [2020-07-29 01:29:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 39957, now seen corresponding path program 1 times [2020-07-29 01:29:47,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:47,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036555670] [2020-07-29 01:29:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:47,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {17#(<= 1 ULTIMATE.start_main_~ytmp~0)} is VALID [2020-07-29 01:29:47,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {17#(<= 1 ULTIMATE.start_main_~ytmp~0)} assume !(0 != main_~ytmp~0); {16#false} is VALID [2020-07-29 01:29:47,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#false} main_~res~0 := 1 + main_~res~0; {16#false} is VALID [2020-07-29 01:29:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:47,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036555670] [2020-07-29 01:29:47,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:47,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:47,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209122176] [2020-07-29 01:29:47,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:47,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:29:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:29:47,730 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-07-29 01:29:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:47,790 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:29:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:29:47,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:47,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:47,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:29:47,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:47,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 9 transitions. [2020-07-29 01:29:47,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:29:47,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:29:47,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-07-29 01:29:47,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:47,815 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:29:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-07-29 01:29:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:29:47,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:47,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:29:47,840 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:29:47,842 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:29:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:47,844 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:29:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:29:47,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:47,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:47,846 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:29:47,846 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:29:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:47,847 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:29:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:29:47,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:47,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:47,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:47,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:29:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:29:47,851 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:29:47,852 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:29:47,852 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:47,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:29:47,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:29:47,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:47,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:47,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:47,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:29:47,854 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 32#L14-2 [2020-07-29 01:29:47,854 INFO L796 eck$LassoCheckResult]: Loop: 32#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 29#L17-2 assume !!(0 != main_~ytmp~0); 30#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 33#L17-2 assume !(0 != main_~ytmp~0); 34#L16-2 main_~res~0 := 1 + main_~res~0; 32#L14-2 [2020-07-29 01:29:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:29:47,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:47,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910790254] [2020-07-29 01:29:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash 38452088, now seen corresponding path program 1 times [2020-07-29 01:29:47,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:47,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509467245] [2020-07-29 01:29:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,886 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash 925955769, now seen corresponding path program 1 times [2020-07-29 01:29:47,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:47,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645655684] [2020-07-29 01:29:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:47,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:47,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:48,036 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:48,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:48,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:48,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:48,038 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:48,038 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:48,039 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:48,039 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration2_Loop [2020-07-29 01:29:48,039 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:48,039 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:48,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,298 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:48,299 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:48,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:48,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:48,324 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:48,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:48,368 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:48,378 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:48,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:48,421 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:48,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:48,466 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:48,491 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~res~0=0} Honda state: {ULTIMATE.start_main_~res~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~res~0=6}, {ULTIMATE.start_main_~res~0=1}, {ULTIMATE.start_main_~res~0=-6}] Lambdas: [1, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:48,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:48,536 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:48,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:48,806 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:48,809 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:48,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:48,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:48,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:48,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:48,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:48,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:48,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:48,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration2_Loop [2020-07-29 01:29:48,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:48,811 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:48,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:48,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:49,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:49,054 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:49,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:49,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:49,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:49,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:49,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:49,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:49,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:49,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:49,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:49,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:49,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:49,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:49,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:49,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:49,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:49,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:49,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:49,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:49,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:49,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:49,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:49,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:49,223 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:49,224 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:49,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:49,233 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:49,234 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:49,234 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:49,279 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0;" "assume !!(0 != main_~ytmp~0);" "assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1;" "assume !(0 != main_~ytmp~0);" "main_~res~0 := 1 + main_~res~0;" [2020-07-29 01:29:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:49,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {59#unseeded} is VALID [2020-07-29 01:29:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:49,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {77#(and (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 oldRank0))} is VALID [2020-07-29 01:29:49,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(and (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 oldRank0))} assume !!(0 != main_~ytmp~0); {77#(and (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 oldRank0))} is VALID [2020-07-29 01:29:49,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#(and (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 oldRank0))} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {84#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:49,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (<= 1 oldRank0))} assume !(0 != main_~ytmp~0); {84#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:49,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#(and (<= (+ ULTIMATE.start_main_~x~0 1) oldRank0) (<= 1 oldRank0))} main_~res~0 := 1 + main_~res~0; {72#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:49,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:49,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:49,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,501 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:49,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-29 01:29:49,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 33 transitions. Complement of second has 7 states. [2020-07-29 01:29:49,584 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 [2020-07-29 01:29:49,584 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:49,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:29:49,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:49,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:49,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:29:49,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:49,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,592 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:29:49,593 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:49,594 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:49,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:49,596 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:49,596 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 33 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:49,599 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:49,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:49,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:49,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:49,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:49,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:49,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:49,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:49,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:49,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:29:49,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:29:49,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:29:49,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:29:49,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:29:49,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:29:49,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:49,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:49,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:49,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:49,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:49,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:49,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:49,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:49,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:49,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:49,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:49,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:49,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:49,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:49,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,637 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:29:49,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:29:49,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:29:49,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 10 letters. [2020-07-29 01:29:49,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:49,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:49,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 25 transitions. [2020-07-29 01:29:49,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:29:49,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:29:49,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:29:49,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:49,649 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:29:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:29:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 01:29:49,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:49,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 01:29:49,653 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 01:29:49,653 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 01:29:49,654 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:49,657 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:29:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:29:49,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:49,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:49,659 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 01:29:49,659 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 01:29:49,660 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:49,663 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:29:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:29:49,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:49,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:49,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:49,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:29:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:29:49,666 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:29:49,667 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:29:49,667 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:49,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:29:49,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:49,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,669 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:29:49,669 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:49,670 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 130#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 127#L17-2 assume !!(0 != main_~ytmp~0); 128#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 132#L17-2 assume !!(0 != main_~ytmp~0); 126#L17 [2020-07-29 01:29:49,670 INFO L796 eck$LassoCheckResult]: Loop: 126#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 125#L17-2 assume !!(0 != main_~ytmp~0); 126#L17 [2020-07-29 01:29:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 29869542, now seen corresponding path program 1 times [2020-07-29 01:29:49,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:49,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947495878] [2020-07-29 01:29:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 1 times [2020-07-29 01:29:49,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:49,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061673042] [2020-07-29 01:29:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1360140509, now seen corresponding path program 2 times [2020-07-29 01:29:49,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:49,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445724066] [2020-07-29 01:29:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:49,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:49,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:49,775 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:49,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:49,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:49,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:49,776 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:49,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:49,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:49,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration3_Loop [2020-07-29 01:29:49,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:49,777 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:49,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:49,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:49,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:49,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:49,949 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:49,949 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:49,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:49,955 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:49,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:49,960 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:50,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:50,015 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,019 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:50,020 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:50,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:50,068 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:50,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:50,119 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,218 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:50,220 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:50,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:50,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:50,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:50,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:50,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:50,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:50,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration3_Loop [2020-07-29 01:29:50,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:50,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:50,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:50,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:50,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:50,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:50,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:50,391 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:50,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:50,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:50,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:50,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:50,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:50,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:50,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:50,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:50,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:50,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:50,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:50,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:50,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:50,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:50,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:50,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:50,511 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:50,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:50,519 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:50,520 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:50,520 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:50,566 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:50,570 INFO L393 LassoCheck]: Loop: "assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1;" "assume !!(0 != main_~ytmp~0);" [2020-07-29 01:29:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:50,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {235#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {235#unseeded} is VALID [2020-07-29 01:29:50,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {235#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {235#unseeded} is VALID [2020-07-29 01:29:50,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#unseeded} assume !!(0 != main_~ytmp~0); {235#unseeded} is VALID [2020-07-29 01:29:50,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {235#unseeded} is VALID [2020-07-29 01:29:50,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {235#unseeded} assume !!(0 != main_~ytmp~0); {235#unseeded} is VALID [2020-07-29 01:29:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,632 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:50,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {265#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:50,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} assume !!(0 != main_~ytmp~0); {248#(or (and (> oldRank0 ULTIMATE.start_main_~ytmp~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:50,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:50,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:50,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,714 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 [2020-07-29 01:29:50,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:29:50,763 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 45 transitions. Complement of second has 5 states. [2020-07-29 01:29:50,765 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 [2020-07-29 01:29:50,765 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:50,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:50,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:50,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:50,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 45 transitions. [2020-07-29 01:29:50,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:50,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:50,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:50,778 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:50,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:50,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:50,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 45 transitions. cyclomatic complexity: 18 [2020-07-29 01:29:50,783 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:50,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:50,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:50,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:50,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:50,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:50,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:50,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 45 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,822 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:29:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. cyclomatic complexity: 18 [2020-07-29 01:29:50,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:50,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 40 transitions. [2020-07-29 01:29:50,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:29:50,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:29:50,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2020-07-29 01:29:50,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:50,844 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-29 01:29:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2020-07-29 01:29:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-07-29 01:29:50,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:50,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 40 transitions. Second operand 24 states. [2020-07-29 01:29:50,849 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 40 transitions. Second operand 24 states. [2020-07-29 01:29:50,849 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 24 states. [2020-07-29 01:29:50,850 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:50,854 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 01:29:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-07-29 01:29:50,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:50,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:50,855 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states and 40 transitions. [2020-07-29 01:29:50,855 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states and 40 transitions. [2020-07-29 01:29:50,856 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:50,864 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 01:29:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-07-29 01:29:50,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:50,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:50,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:50,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:29:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-07-29 01:29:50,868 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-29 01:29:50,868 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-29 01:29:50,868 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:50,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2020-07-29 01:29:50,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:50,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:29:50,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:50,872 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 314#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 318#L17-2 assume !!(0 != main_~ytmp~0); 329#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 328#L17-2 assume !!(0 != main_~ytmp~0); 312#L17 assume !(main_~ytmp~0 > 0);main_~ytmp~0 := 1 + main_~ytmp~0;main_~x~0 := 1 + main_~x~0; 324#L17-2 [2020-07-29 01:29:50,872 INFO L796 eck$LassoCheckResult]: Loop: 324#L17-2 assume !!(0 != main_~ytmp~0); 325#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 324#L17-2 [2020-07-29 01:29:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash 925955826, now seen corresponding path program 1 times [2020-07-29 01:29:50,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:50,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388281732] [2020-07-29 01:29:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:50,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {455#true} is VALID [2020-07-29 01:29:50,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#true} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {455#true} is VALID [2020-07-29 01:29:50,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {455#true} assume !!(0 != main_~ytmp~0); {455#true} is VALID [2020-07-29 01:29:50,975 INFO L280 TraceCheckUtils]: 3: Hoare triple {455#true} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {457#(<= 0 ULTIMATE.start_main_~ytmp~0)} is VALID [2020-07-29 01:29:50,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {457#(<= 0 ULTIMATE.start_main_~ytmp~0)} assume !!(0 != main_~ytmp~0); {458#(and (not (= 0 ULTIMATE.start_main_~ytmp~0)) (<= 0 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:50,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {458#(and (not (= 0 ULTIMATE.start_main_~ytmp~0)) (<= 0 ULTIMATE.start_main_~ytmp~0))} assume !(main_~ytmp~0 > 0);main_~ytmp~0 := 1 + main_~ytmp~0;main_~x~0 := 1 + main_~x~0; {456#false} is VALID [2020-07-29 01:29:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:50,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388281732] [2020-07-29 01:29:50,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:50,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:29:50,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655217162] [2020-07-29 01:29:50,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1572, now seen corresponding path program 2 times [2020-07-29 01:29:50,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:50,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873887239] [2020-07-29 01:29:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:50,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:50,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:50,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:51,018 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:51,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:51,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:51,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:51,018 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:51,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:51,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:51,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration4_Loop [2020-07-29 01:29:51,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:51,019 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:51,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:51,151 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:51,162 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:51,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:51,212 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,253 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:51,255 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:51,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:51,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:51,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:51,256 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:51,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:51,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:51,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration4_Loop [2020-07-29 01:29:51,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:51,257 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:51,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:51,397 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:51,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:51,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:51,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:51,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:51,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:51,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:51,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:51,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:51,427 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:51,427 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:51,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:51,434 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:51,434 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] [2020-07-29 01:29:51,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:51,482 INFO L393 LassoCheck]: Loop: "assume !!(0 != main_~ytmp~0);" "assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:29:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:51,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {461#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {461#unseeded} is VALID [2020-07-29 01:29:51,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {461#unseeded} is VALID [2020-07-29 01:29:51,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#unseeded} assume !!(0 != main_~ytmp~0); {461#unseeded} is VALID [2020-07-29 01:29:51,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {461#unseeded} is VALID [2020-07-29 01:29:51,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {461#unseeded} assume !!(0 != main_~ytmp~0); {461#unseeded} is VALID [2020-07-29 01:29:51,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {461#unseeded} assume !(main_~ytmp~0 > 0);main_~ytmp~0 := 1 + main_~ytmp~0;main_~x~0 := 1 + main_~x~0; {461#unseeded} is VALID [2020-07-29 01:29:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,554 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:51,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume !!(0 != main_~ytmp~0); {464#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} is VALID [2020-07-29 01:29:51,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {464#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {474#(or (and (> oldRank0 ULTIMATE.start_main_~ytmp~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:51,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:51,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:51,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:51,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-29 01:29:51,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 32 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:29:51,619 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 [2020-07-29 01:29:51,620 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:51,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:51,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:51,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:51,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:51,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:51,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:51,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:51,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2020-07-29 01:29:51,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:51,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:51,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:51,623 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 34 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:51,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:51,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:51,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:51,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:51,626 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 47 transitions. cyclomatic complexity: 20 [2020-07-29 01:29:51,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:51,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:51,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:51,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:51,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:51,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:51,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:51,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:51,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:51,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:51,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:51,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:51,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:29:51,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:51,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:51,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:29:51,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:51,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:51,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:51,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:29:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:29:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:51,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:51,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,656 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 01:29:51,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:51,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:51,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. cyclomatic complexity: 20 [2020-07-29 01:29:51,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:29:51,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 44 transitions. [2020-07-29 01:29:51,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:29:51,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:29:51,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2020-07-29 01:29:51,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:51,664 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-07-29 01:29:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2020-07-29 01:29:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-29 01:29:51,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:51,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 44 transitions. Second operand 28 states. [2020-07-29 01:29:51,667 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 44 transitions. Second operand 28 states. [2020-07-29 01:29:51,667 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 28 states. [2020-07-29 01:29:51,667 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:51,670 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2020-07-29 01:29:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-07-29 01:29:51,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,672 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states and 44 transitions. [2020-07-29 01:29:51,672 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states and 44 transitions. [2020-07-29 01:29:51,672 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:51,675 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2020-07-29 01:29:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-07-29 01:29:51,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:51,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:29:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-29 01:29:51,678 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-29 01:29:51,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:29:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:29:51,679 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2020-07-29 01:29:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:51,705 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 01:29:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:29:51,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:51,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:51,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2020-07-29 01:29:51,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:51,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2020-07-29 01:29:51,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:29:51,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:29:51,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2020-07-29 01:29:51,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:51,717 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:29:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2020-07-29 01:29:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-29 01:29:51,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:51,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 18 transitions. Second operand 12 states. [2020-07-29 01:29:51,719 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 18 transitions. Second operand 12 states. [2020-07-29 01:29:51,719 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 12 states. [2020-07-29 01:29:51,720 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:51,721 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:29:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:29:51,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,722 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 14 states and 18 transitions. [2020-07-29 01:29:51,723 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 14 states and 18 transitions. [2020-07-29 01:29:51,724 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:51,725 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:29:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:29:51,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:51,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:29:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-29 01:29:51,728 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 01:29:51,728 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 01:29:51,728 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:51,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-07-29 01:29:51,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:51,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:51,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:51,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2020-07-29 01:29:51,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:51,730 INFO L794 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 723#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 720#L17-2 assume !!(0 != main_~ytmp~0); 721#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 724#L17-2 assume !(0 != main_~ytmp~0); 727#L16-2 main_~res~0 := 1 + main_~res~0; 725#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 726#L17-2 assume !!(0 != main_~ytmp~0); 729#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 728#L17-2 assume !!(0 != main_~ytmp~0); 719#L17 [2020-07-29 01:29:51,730 INFO L796 eck$LassoCheckResult]: Loop: 719#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 718#L17-2 assume !!(0 != main_~ytmp~0); 719#L17 [2020-07-29 01:29:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1275475969, now seen corresponding path program 2 times [2020-07-29 01:29:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:51,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970009831] [2020-07-29 01:29:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {819#true} is VALID [2020-07-29 01:29:51,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {821#(= ULTIMATE.start_main_~ytmp~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:51,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#(= ULTIMATE.start_main_~ytmp~0 ULTIMATE.start_main_~y~0)} assume !!(0 != main_~ytmp~0); {821#(= ULTIMATE.start_main_~ytmp~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:29:51,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#(= ULTIMATE.start_main_~ytmp~0 ULTIMATE.start_main_~y~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {822#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~ytmp~0 1)))} is VALID [2020-07-29 01:29:51,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {822#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~ytmp~0 1)))} assume !(0 != main_~ytmp~0); {823#(and (<= ULTIMATE.start_main_~y~0 1) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:29:51,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {823#(and (<= ULTIMATE.start_main_~y~0 1) (<= 1 ULTIMATE.start_main_~y~0))} main_~res~0 := 1 + main_~res~0; {823#(and (<= ULTIMATE.start_main_~y~0 1) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 01:29:51,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {823#(and (<= ULTIMATE.start_main_~y~0 1) (<= 1 ULTIMATE.start_main_~y~0))} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:51,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} assume !!(0 != main_~ytmp~0); {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:51,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {825#(and (<= ULTIMATE.start_main_~ytmp~0 0) (<= 0 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:51,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {825#(and (<= ULTIMATE.start_main_~ytmp~0 0) (<= 0 ULTIMATE.start_main_~ytmp~0))} assume !!(0 != main_~ytmp~0); {820#false} is VALID [2020-07-29 01:29:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:51,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970009831] [2020-07-29 01:29:51,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849188756] [2020-07-29 01:29:51,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:51,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:29:51,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:51,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:29:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {819#true} is VALID [2020-07-29 01:29:52,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {832#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~ytmp~0)} is VALID [2020-07-29 01:29:52,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {832#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~ytmp~0)} assume !!(0 != main_~ytmp~0); {832#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~ytmp~0)} is VALID [2020-07-29 01:29:52,045 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#(<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {839#(<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~ytmp~0 1))} is VALID [2020-07-29 01:29:52,045 INFO L280 TraceCheckUtils]: 4: Hoare triple {839#(<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~ytmp~0 1))} assume !(0 != main_~ytmp~0); {843#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:52,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {843#(<= ULTIMATE.start_main_~y~0 1)} main_~res~0 := 1 + main_~res~0; {843#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:29:52,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {843#(<= ULTIMATE.start_main_~y~0 1)} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:52,047 INFO L280 TraceCheckUtils]: 7: Hoare triple {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} assume !!(0 != main_~ytmp~0); {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:52,048 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(and (<= ULTIMATE.start_main_~ytmp~0 1) (<= 1 ULTIMATE.start_main_~ytmp~0))} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {825#(and (<= ULTIMATE.start_main_~ytmp~0 0) (<= 0 ULTIMATE.start_main_~ytmp~0))} is VALID [2020-07-29 01:29:52,049 INFO L280 TraceCheckUtils]: 9: Hoare triple {825#(and (<= ULTIMATE.start_main_~ytmp~0 0) (<= 0 ULTIMATE.start_main_~ytmp~0))} assume !!(0 != main_~ytmp~0); {820#false} is VALID [2020-07-29 01:29:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:52,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:52,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 01:29:52,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379395843] [2020-07-29 01:29:52,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 3 times [2020-07-29 01:29:52,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:52,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193340009] [2020-07-29 01:29:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:52,087 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:52,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:52,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:52,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:52,088 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:52,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:52,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:52,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration5_Loop [2020-07-29 01:29:52,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:52,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:52,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,230 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:52,230 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,235 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:52,262 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,297 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:52,297 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0=0}, {ULTIMATE.start_main_~x~0=2}, {ULTIMATE.start_main_~x~0=-3}] Lambdas: [6, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:52,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:52,324 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:52,350 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:52,350 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,374 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:52,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:52,459 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:52,460 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:52,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:52,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:52,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:52,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:52,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:52,461 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:52,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: DivMinus2.c_Iteration5_Loop [2020-07-29 01:29:52,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:52,461 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:52,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,622 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:52,622 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:52,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:52,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:52,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:52,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:52,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:52,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:52,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:52,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:52,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:52,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:52,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:52,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:52,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:52,768 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:52,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:52,771 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:52,771 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] [2020-07-29 01:29:52,794 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:52,800 INFO L393 LassoCheck]: Loop: "assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1;" "assume !!(0 != main_~ytmp~0);" [2020-07-29 01:29:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {858#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {858#unseeded} is VALID [2020-07-29 01:29:52,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:52,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:52,848 INFO L280 TraceCheckUtils]: 3: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:52,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {858#unseeded} assume !(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:52,849 INFO L280 TraceCheckUtils]: 5: Hoare triple {858#unseeded} main_~res~0 := 1 + main_~res~0; {858#unseeded} is VALID [2020-07-29 01:29:52,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:52,850 INFO L280 TraceCheckUtils]: 7: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:52,850 INFO L280 TraceCheckUtils]: 8: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:52,851 INFO L280 TraceCheckUtils]: 9: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,854 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {903#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:52,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {903#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} assume !!(0 != main_~ytmp~0); {871#(or (and (> oldRank0 ULTIMATE.start_main_~ytmp~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:52,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:52,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:52,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,943 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 [2020-07-29 01:29:52,943 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:52,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 20 states and 24 transitions. Complement of second has 5 states. [2020-07-29 01:29:52,977 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 [2020-07-29 01:29:52,977 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:52,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:52,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:52,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:52,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2020-07-29 01:29:52,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:52,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,980 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:52,981 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:52,981 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:52,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:52,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:52,982 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:52,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:52,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,997 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:29:52,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:52,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,999 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {858#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {858#unseeded} is VALID [2020-07-29 01:29:53,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:53,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:53,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {858#unseeded} assume !(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {858#unseeded} main_~res~0 := 1 + main_~res~0; {858#unseeded} is VALID [2020-07-29 01:29:53,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:53,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:53,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,044 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {965#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:53,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {965#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} assume !!(0 != main_~ytmp~0); {871#(or (and (> oldRank0 ULTIMATE.start_main_~ytmp~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:53,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:53,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:53,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,119 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 [2020-07-29 01:29:53,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:53,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 5 states. [2020-07-29 01:29:53,160 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 [2020-07-29 01:29:53,161 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:53,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-07-29 01:29:53,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,164 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,164 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:53,164 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:53,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,165 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:53,165 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:53,166 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:53,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:53,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,181 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:29:53,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,182 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {858#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; {858#unseeded} is VALID [2020-07-29 01:29:53,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:53,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:53,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {858#unseeded} assume !(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {858#unseeded} main_~res~0 := 1 + main_~res~0; {858#unseeded} is VALID [2020-07-29 01:29:53,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {858#unseeded} assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; {858#unseeded} is VALID [2020-07-29 01:29:53,225 INFO L280 TraceCheckUtils]: 7: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,226 INFO L280 TraceCheckUtils]: 8: Hoare triple {858#unseeded} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {858#unseeded} is VALID [2020-07-29 01:29:53,226 INFO L280 TraceCheckUtils]: 9: Hoare triple {858#unseeded} assume !!(0 != main_~ytmp~0); {858#unseeded} is VALID [2020-07-29 01:29:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,235 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(>= oldRank0 ULTIMATE.start_main_~ytmp~0)} assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; {1026#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:53,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#(and (<= (+ ULTIMATE.start_main_~ytmp~0 1) oldRank0) (<= 1 oldRank0))} assume !!(0 != main_~ytmp~0); {871#(or (and (> oldRank0 ULTIMATE.start_main_~ytmp~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:53,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:53,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:53,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,315 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 [2020-07-29 01:29:53,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:53,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 6 states. [2020-07-29 01:29:53,345 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 [2020-07-29 01:29:53,346 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:53,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-07-29 01:29:53,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:53,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:53,348 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,348 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:53,348 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:53,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,349 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:53,349 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:53,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:53,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:53,349 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:53,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:29:53,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:29:53,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:53,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:29:53,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:53,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:53,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:29:53,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:53,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:53,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2020-07-29 01:29:53,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:53,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:53,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:53,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:53,393 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:53,393 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:53,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:29:53,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:29:53,395 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 10 states. [2020-07-29 01:29:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:53,396 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:29:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:29:53,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:29:53,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:53,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:53,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:53,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:53,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:53,456 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:53,456 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:53,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:53,457 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:53,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:53,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:53 BoogieIcfgContainer [2020-07-29 01:29:53,464 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:53,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:53,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:53,465 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:53,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:47" (3/4) ... [2020-07-29 01:29:53,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:53,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:53,473 INFO L168 Benchmark]: Toolchain (without parser) took 6915.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -332.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,474 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.37 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,476 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,477 INFO L168 Benchmark]: RCFGBuilder took 291.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,478 INFO L168 Benchmark]: BuchiAutomizer took 6161.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.6 MB). Peak memory consumption was 174.8 kB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,478 INFO L168 Benchmark]: Witness Printer took 5.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.37 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 291.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6161.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.6 MB). Peak memory consumption was 174.8 kB. Max. memory is 11.5 GB. * Witness Printer took 5.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function ytmp and consists of 3 locations. One deterministic module has affine ranking function ytmp and consists of 3 locations. One nondeterministic module has affine ranking function ytmp and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 49 SDtfs, 64 SDslu, 16 SDs, 0 SdLazy, 61 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax164 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq172 hnf94 smp84 dnf100 smp100 tf111 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...