./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 5261f7e3f458f6917c67b6b46c5812f0eca694f4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:21:10,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:21:10,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:21:10,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:21:10,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:21:10,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:21:10,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:21:10,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:21:10,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:21:10,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:21:10,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:21:10,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:21:10,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:21:10,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:21:10,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:21:10,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:21:10,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:21:10,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:21:10,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:21:10,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:21:10,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:21:10,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:21:10,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:21:10,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:21:10,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:21:10,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:21:10,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:21:10,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:21:10,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:21:10,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:21:10,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:21:10,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:21:10,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:21:10,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:21:10,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:21:10,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:21:10,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:21:10,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:21:10,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:21:10,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:21:10,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:21:10,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:21:10,344 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:21:10,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:21:10,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:21:10,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:21:10,346 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:21:10,347 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:21:10,347 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:21:10,347 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:21:10,347 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:21:10,348 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:21:10,348 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:21:10,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:21:10,349 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:21:10,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:21:10,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:21:10,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:21:10,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:21:10,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:21:10,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:21:10,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:21:10,351 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:21:10,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:21:10,351 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:21:10,352 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:21:10,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:21:10,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:21:10,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:21:10,353 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:21:10,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:21:10,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:21:10,354 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:21:10,354 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:21:10,355 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:21:10,355 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5261f7e3f458f6917c67b6b46c5812f0eca694f4 [2020-07-29 03:21:10,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:21:10,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:21:10,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:21:10,653 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:21:10,654 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:21:10,655 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:21:10,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53838c92/57148e574a024425a6d8045dbdfbd0b6/FLAGf1d94d7c3 [2020-07-29 03:21:11,228 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:21:11,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:21:11,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53838c92/57148e574a024425a6d8045dbdfbd0b6/FLAGf1d94d7c3 [2020-07-29 03:21:11,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53838c92/57148e574a024425a6d8045dbdfbd0b6 [2020-07-29 03:21:11,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:21:11,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:21:11,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:21:11,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:21:11,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:21:11,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:21:11" (1/1) ... [2020-07-29 03:21:11,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f2f3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:11, skipping insertion in model container [2020-07-29 03:21:11,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:21:11" (1/1) ... [2020-07-29 03:21:11,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:21:11,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:21:11,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:21:12,030 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:21:12,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:21:12,129 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:21:12,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12 WrapperNode [2020-07-29 03:21:12,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:21:12,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:21:12,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:21:12,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:21:12,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:21:12,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:21:12,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:21:12,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:21:12,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (1/1) ... [2020-07-29 03:21:12,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:21:12,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:21:12,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:21:12,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:21:12,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (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 03:21:12,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:21:12,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:21:13,444 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:21:13,445 INFO L295 CfgBuilder]: Removed 19 assume(true) statements. [2020-07-29 03:21:13,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:21:13 BoogieIcfgContainer [2020-07-29 03:21:13,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:21:13,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:21:13,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:21:13,456 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:21:13,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:21:13,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:21:11" (1/3) ... [2020-07-29 03:21:13,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31539d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:21:13, skipping insertion in model container [2020-07-29 03:21:13,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:21:13,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:21:12" (2/3) ... [2020-07-29 03:21:13,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31539d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:21:13, skipping insertion in model container [2020-07-29 03:21:13,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:21:13,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:21:13" (3/3) ... [2020-07-29 03:21:13,463 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:21:13,509 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:21:13,510 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:21:13,510 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:21:13,510 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:21:13,510 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:21:13,511 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:21:13,511 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:21:13,511 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:21:13,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2020-07-29 03:21:13,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:21:13,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:13,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:13,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:13,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:13,603 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:21:13,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2020-07-29 03:21:13,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:21:13,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:13,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:13,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:13,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:13,636 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 34#L304true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 14#L307-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 63#L317true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 60#L320-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 115#L330true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 98#L333-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 8#L343true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 130#L346-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 37#L356true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 33#L359-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 85#L369true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 62#L372-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 120#L382true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 123#L382-1true init_#res := init_~tmp___5~0; 134#L503true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 107#L66true assume !(0 == assume_abort_if_not_~cond); 15#L65true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 70#L614-2true [2020-07-29 03:21:13,637 INFO L796 eck$LassoCheckResult]: Loop: 70#L614-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 80#L127true assume !(0 != ~mode1~0 % 256); 40#L155true assume !(~r1~0 < 2); 38#L155-1true ~mode1~0 := 1; 58#L127-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 136#L178true assume !(0 != ~mode2~0 % 256); 129#L206true assume !(~r2~0 < 2); 127#L206-1true ~mode2~0 := 1; 131#L178-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 54#L229true assume !(0 != ~mode3~0 % 256); 49#L257true assume !(~r3~0 < 2); 48#L257-1true ~mode3~0 := 1; 68#L229-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 11#L511true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 137#L511-1true check_#res := check_~tmp~1; 90#L559true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 93#L644true assume !(0 == assert_~arg % 256); 79#L639true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 70#L614-2true [2020-07-29 03:21:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2020-07-29 03:21:13,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:13,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283749032] [2020-07-29 03:21:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:13,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {146#true} is VALID [2020-07-29 03:21:13,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {146#true} is VALID [2020-07-29 03:21:13,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,958 INFO L280 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,961 INFO L280 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,963 INFO L280 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {146#true} is VALID [2020-07-29 03:21:13,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {146#true} is VALID [2020-07-29 03:21:13,965 INFO L280 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {148#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:21:13,966 INFO L280 TraceCheckUtils]: 15: Hoare triple {148#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {149#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:21:13,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {149#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {150#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:21:13,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {150#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {147#false} is VALID [2020-07-29 03:21:13,969 INFO L280 TraceCheckUtils]: 18: Hoare triple {147#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {147#false} is VALID [2020-07-29 03:21:13,974 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 03:21:13,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283749032] [2020-07-29 03:21:13,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:13,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:21:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671666508] [2020-07-29 03:21:13,986 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:21:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2020-07-29 03:21:13,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:13,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49677988] [2020-07-29 03:21:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:14,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {151#true} is VALID [2020-07-29 03:21:14,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume !(0 != ~mode1~0 % 256); {151#true} is VALID [2020-07-29 03:21:14,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(~r1~0 < 2); {151#true} is VALID [2020-07-29 03:21:14,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {151#true} ~mode1~0 := 1; {151#true} is VALID [2020-07-29 03:21:14,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {151#true} is VALID [2020-07-29 03:21:14,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} assume !(0 != ~mode2~0 % 256); {151#true} is VALID [2020-07-29 03:21:14,194 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} assume !(~r2~0 < 2); {151#true} is VALID [2020-07-29 03:21:14,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#true} ~mode2~0 := 1; {151#true} is VALID [2020-07-29 03:21:14,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {151#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {151#true} is VALID [2020-07-29 03:21:14,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {151#true} assume !(0 != ~mode3~0 % 256); {151#true} is VALID [2020-07-29 03:21:14,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#true} assume !(~r3~0 < 2); {151#true} is VALID [2020-07-29 03:21:14,196 INFO L280 TraceCheckUtils]: 11: Hoare triple {151#true} ~mode3~0 := 1; {151#true} is VALID [2020-07-29 03:21:14,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {151#true} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {151#true} is VALID [2020-07-29 03:21:14,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {151#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {153#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:21:14,198 INFO L280 TraceCheckUtils]: 14: Hoare triple {153#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {154#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:21:14,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {154#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {155#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:21:14,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {155#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {152#false} is VALID [2020-07-29 03:21:14,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {152#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {152#false} is VALID [2020-07-29 03:21:14,204 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 03:21:14,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49677988] [2020-07-29 03:21:14,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:14,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:21:14,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183972872] [2020-07-29 03:21:14,207 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:21:14,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:21:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:21:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:21:14,224 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2020-07-29 03:21:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:15,128 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2020-07-29 03:21:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:21:15,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:21:15,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:15,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 247 transitions. [2020-07-29 03:21:15,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:21:15,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 137 states and 231 transitions. [2020-07-29 03:21:15,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2020-07-29 03:21:15,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2020-07-29 03:21:15,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2020-07-29 03:21:15,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:15,189 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:21:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2020-07-29 03:21:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-29 03:21:15,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:21:15,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:21:15,230 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:21:15,232 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. Second operand 137 states. [2020-07-29 03:21:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:15,241 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2020-07-29 03:21:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:21:15,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:15,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:15,246 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states and 231 transitions. [2020-07-29 03:21:15,247 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states and 231 transitions. [2020-07-29 03:21:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:15,256 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2020-07-29 03:21:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:21:15,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:15,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:15,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:21:15,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:21:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 03:21:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2020-07-29 03:21:15,266 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:21:15,266 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2020-07-29 03:21:15,266 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:21:15,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2020-07-29 03:21:15,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:21:15,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:15,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:15,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:15,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:15,271 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 328#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 329#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 331#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 333#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 323#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 404#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 375#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 319#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 320#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 371#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 364#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 367#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 354#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 406#L382 assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 307#L382-1 init_#res := init_~tmp___5~0; 440#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 434#L66 assume !(0 == assume_abort_if_not_~cond); 334#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 335#L614-2 [2020-07-29 03:21:15,271 INFO L796 eck$LassoCheckResult]: Loop: 335#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 410#L127 assume !(0 != ~mode1~0 % 256); 376#L155 assume !(~r1~0 < 2); 372#L155-1 ~mode1~0 := 1; 373#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 402#L178 assume !(0 != ~mode2~0 % 256); 442#L206 assume !(~r2~0 < 2); 386#L206-1 ~mode2~0 := 1; 339#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 397#L229 assume !(0 != ~mode3~0 % 256); 389#L257 assume !(~r3~0 < 2); 379#L257-1 ~mode3~0 := 1; 388#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 326#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 327#L512 assume ~st1~0 + ~nl1~0 <= 1; 382#L513 assume ~st2~0 + ~nl2~0 <= 1; 383#L514 assume ~st3~0 + ~nl3~0 <= 1; 411#L515 assume ~r1~0 >= 2; 336#L519 assume ~r1~0 < 2; 338#L524 assume ~r1~0 >= 2; 380#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 325#L511-1 check_#res := check_~tmp~1; 424#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 425#L644 assume !(0 == assert_~arg % 256); 416#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 335#L614-2 [2020-07-29 03:21:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2020-07-29 03:21:15,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:15,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578053360] [2020-07-29 03:21:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:15,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {720#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {720#true} is VALID [2020-07-29 03:21:15,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {720#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {720#true} is VALID [2020-07-29 03:21:15,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {720#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {720#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {720#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {720#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {720#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {720#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {720#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {720#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {720#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {720#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {720#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {720#true} is VALID [2020-07-29 03:21:15,357 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {720#true} is VALID [2020-07-29 03:21:15,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {720#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; {722#(= 0 ULTIMATE.start_init_~tmp___5~0)} is VALID [2020-07-29 03:21:15,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {722#(= 0 ULTIMATE.start_init_~tmp___5~0)} init_#res := init_~tmp___5~0; {723#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:21:15,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {723#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {724#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:21:15,360 INFO L280 TraceCheckUtils]: 17: Hoare triple {724#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {721#false} is VALID [2020-07-29 03:21:15,361 INFO L280 TraceCheckUtils]: 18: Hoare triple {721#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {721#false} is VALID [2020-07-29 03:21:15,362 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 03:21:15,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578053360] [2020-07-29 03:21:15,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:15,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:21:15,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350861191] [2020-07-29 03:21:15,364 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:21:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2020-07-29 03:21:15,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:15,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843427865] [2020-07-29 03:21:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:15,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {725#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {725#true} is VALID [2020-07-29 03:21:15,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {725#true} assume !(0 != ~mode1~0 % 256); {725#true} is VALID [2020-07-29 03:21:15,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {725#true} assume !(~r1~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {727#(< 1 ~r1~0)} ~mode1~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {727#(< 1 ~r1~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {727#(< 1 ~r1~0)} assume !(0 != ~mode2~0 % 256); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {727#(< 1 ~r1~0)} assume !(~r2~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {727#(< 1 ~r1~0)} ~mode2~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {727#(< 1 ~r1~0)} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {727#(< 1 ~r1~0)} assume !(0 != ~mode3~0 % 256); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,409 INFO L280 TraceCheckUtils]: 10: Hoare triple {727#(< 1 ~r1~0)} assume !(~r3~0 < 2); {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {727#(< 1 ~r1~0)} ~mode3~0 := 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,411 INFO L280 TraceCheckUtils]: 12: Hoare triple {727#(< 1 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,411 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#(< 1 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#(< 1 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,413 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#(< 1 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {727#(< 1 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,414 INFO L280 TraceCheckUtils]: 17: Hoare triple {727#(< 1 ~r1~0)} assume ~r1~0 >= 2; {727#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:15,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {727#(< 1 ~r1~0)} assume ~r1~0 < 2; {726#false} is VALID [2020-07-29 03:21:15,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {726#false} assume ~r1~0 >= 2; {726#false} is VALID [2020-07-29 03:21:15,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {726#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {726#false} is VALID [2020-07-29 03:21:15,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {726#false} check_#res := check_~tmp~1; {726#false} is VALID [2020-07-29 03:21:15,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {726#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {726#false} is VALID [2020-07-29 03:21:15,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {726#false} assume !(0 == assert_~arg % 256); {726#false} is VALID [2020-07-29 03:21:15,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {726#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {726#false} is VALID [2020-07-29 03:21:15,419 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 03:21:15,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843427865] [2020-07-29 03:21:15,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:15,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:21:15,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191434823] [2020-07-29 03:21:15,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:21:15,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:21:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:21:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:21:15,422 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 Second operand 5 states. [2020-07-29 03:21:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,118 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2020-07-29 03:21:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:21:16,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:21:16,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:16,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2020-07-29 03:21:16,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:21:16,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2020-07-29 03:21:16,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2020-07-29 03:21:16,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2020-07-29 03:21:16,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2020-07-29 03:21:16,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:16,162 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:21:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2020-07-29 03:21:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-29 03:21:16,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:21:16,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:21:16,170 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:21:16,171 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand 137 states. [2020-07-29 03:21:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,177 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2020-07-29 03:21:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:21:16,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:16,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:16,178 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states and 201 transitions. [2020-07-29 03:21:16,179 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states and 201 transitions. [2020-07-29 03:21:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,185 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2020-07-29 03:21:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:21:16,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:16,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:16,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:21:16,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:21:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 03:21:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2020-07-29 03:21:16,192 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:21:16,192 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2020-07-29 03:21:16,192 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:21:16,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2020-07-29 03:21:16,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-07-29 03:21:16,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:16,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:16,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:16,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:16,197 INFO L794 eck$LassoCheckResult]: Stem: 999#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 893#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 894#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 896#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 900#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 888#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 970#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 940#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 884#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 885#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 936#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 929#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 932#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 920#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 972#L382 assume ~id1~0 != ~id2~0; 983#L383 assume ~id1~0 != ~id3~0; 916#L384 assume ~id2~0 != ~id3~0; 917#L385 assume ~id1~0 >= 0; 967#L386 assume ~id2~0 >= 0; 882#L387 assume ~id3~0 >= 0; 883#L388 assume 0 == ~r1~0; 960#L389 assume 0 == ~r2~0; 961#L390 assume 0 == ~r3~0; 986#L391 assume 0 != init_~r122~0 % 256; 925#L392 assume 0 != init_~r132~0 % 256; 926#L393 assume 0 != init_~r212~0 % 256; 981#L394 assume 0 != init_~r232~0 % 256; 909#L395 assume 0 != init_~r312~0 % 256; 910#L396 assume 0 != init_~r322~0 % 256; 966#L397 assume ~max1~0 == ~id1~0; 874#L398 assume ~max2~0 == ~id2~0; 875#L399 assume ~max3~0 == ~id3~0; 958#L400 assume 0 == ~st1~0; 959#L401 assume 0 == ~st2~0; 985#L402 assume 0 == ~st3~0; 923#L403 assume 0 == ~nl1~0; 924#L404 assume 0 == ~nl2~0; 980#L405 assume 0 == ~nl3~0; 907#L406 assume 0 == ~mode1~0 % 256; 908#L407 assume 0 == ~mode2~0 % 256; 965#L408 assume 0 == ~mode3~0 % 256; 872#L409 assume 0 != ~newmax1~0 % 256; 873#L410 assume 0 != ~newmax2~0 % 256; 956#L411 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 957#L382-1 init_#res := init_~tmp___5~0; 1006#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1000#L66 assume !(0 == assume_abort_if_not_~cond); 898#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 899#L614-2 [2020-07-29 03:21:16,197 INFO L796 eck$LassoCheckResult]: Loop: 899#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 976#L127 assume !(0 != ~mode1~0 % 256); 941#L155 assume !(~r1~0 < 2); 937#L155-1 ~mode1~0 := 1; 938#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 968#L178 assume !(0 != ~mode2~0 % 256); 1008#L206 assume !(~r2~0 < 2); 951#L206-1 ~mode2~0 := 1; 904#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 963#L229 assume !(0 != ~mode3~0 % 256); 954#L257 assume !(~r3~0 < 2); 944#L257-1 ~mode3~0 := 1; 953#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 891#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 892#L512 assume ~st1~0 + ~nl1~0 <= 1; 947#L513 assume ~st2~0 + ~nl2~0 <= 1; 948#L514 assume ~st3~0 + ~nl3~0 <= 1; 977#L515 assume ~r1~0 >= 2; 901#L519 assume ~r1~0 < 2; 903#L524 assume ~r1~0 >= 2; 945#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 890#L511-1 check_#res := check_~tmp~1; 990#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 991#L644 assume !(0 == assert_~arg % 256); 982#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 899#L614-2 [2020-07-29 03:21:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2020-07-29 03:21:16,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:16,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049973848] [2020-07-29 03:21:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:21:16,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2020-07-29 03:21:16,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:16,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793879912] [2020-07-29 03:21:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:16,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {1288#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {1288#true} is VALID [2020-07-29 03:21:16,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1288#true} assume !(0 != ~mode1~0 % 256); {1288#true} is VALID [2020-07-29 03:21:16,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(~r1~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {1290#(< 1 ~r1~0)} ~mode1~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {1290#(< 1 ~r1~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {1290#(< 1 ~r1~0)} assume !(0 != ~mode2~0 % 256); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {1290#(< 1 ~r1~0)} assume !(~r2~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(< 1 ~r1~0)} ~mode2~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,396 INFO L280 TraceCheckUtils]: 8: Hoare triple {1290#(< 1 ~r1~0)} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {1290#(< 1 ~r1~0)} assume !(0 != ~mode3~0 % 256); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {1290#(< 1 ~r1~0)} assume !(~r3~0 < 2); {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {1290#(< 1 ~r1~0)} ~mode3~0 := 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,399 INFO L280 TraceCheckUtils]: 12: Hoare triple {1290#(< 1 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {1290#(< 1 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {1290#(< 1 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {1290#(< 1 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {1290#(< 1 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {1290#(< 1 ~r1~0)} assume ~r1~0 >= 2; {1290#(< 1 ~r1~0)} is VALID [2020-07-29 03:21:16,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {1290#(< 1 ~r1~0)} assume ~r1~0 < 2; {1289#false} is VALID [2020-07-29 03:21:16,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {1289#false} assume ~r1~0 >= 2; {1289#false} is VALID [2020-07-29 03:21:16,404 INFO L280 TraceCheckUtils]: 20: Hoare triple {1289#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {1289#false} is VALID [2020-07-29 03:21:16,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {1289#false} check_#res := check_~tmp~1; {1289#false} is VALID [2020-07-29 03:21:16,405 INFO L280 TraceCheckUtils]: 22: Hoare triple {1289#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1289#false} is VALID [2020-07-29 03:21:16,405 INFO L280 TraceCheckUtils]: 23: Hoare triple {1289#false} assume !(0 == assert_~arg % 256); {1289#false} is VALID [2020-07-29 03:21:16,405 INFO L280 TraceCheckUtils]: 24: Hoare triple {1289#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1289#false} is VALID [2020-07-29 03:21:16,408 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 03:21:16,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793879912] [2020-07-29 03:21:16,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:16,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:21:16,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585435159] [2020-07-29 03:21:16,410 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:21:16,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:21:16,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:21:16,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:21:16,410 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. cyclomatic complexity: 65 Second operand 3 states. [2020-07-29 03:21:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,723 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2020-07-29 03:21:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:21:16,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:21:16,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:16,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2020-07-29 03:21:16,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 288 transitions. [2020-07-29 03:21:16,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2020-07-29 03:21:16,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2020-07-29 03:21:16,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:16,780 INFO L688 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2020-07-29 03:21:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2020-07-29 03:21:16,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:21:16,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states and 288 transitions. Second operand 195 states. [2020-07-29 03:21:16,804 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states and 288 transitions. Second operand 195 states. [2020-07-29 03:21:16,804 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand 195 states. [2020-07-29 03:21:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,812 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2020-07-29 03:21:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:16,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:16,814 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 195 states and 288 transitions. [2020-07-29 03:21:16,814 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 195 states and 288 transitions. [2020-07-29 03:21:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:16,823 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2020-07-29 03:21:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:21:16,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:21:16,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:21:16,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:21:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-07-29 03:21:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2020-07-29 03:21:16,831 INFO L711 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2020-07-29 03:21:16,832 INFO L591 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2020-07-29 03:21:16,832 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:21:16,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. [2020-07-29 03:21:16,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2020-07-29 03:21:16,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:16,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:16,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:16,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:21:16,836 INFO L794 eck$LassoCheckResult]: Stem: 1618#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 1507#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 1508#L304 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1510#L307-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1512#L317 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1502#L320-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1582#L330 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 1553#L333-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1498#L343 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 1499#L346-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1549#L356 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 1542#L359-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1545#L369 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 1532#L372-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1584#L382 assume ~id1~0 != ~id2~0; 1599#L383 assume ~id1~0 != ~id3~0; 1524#L384 assume ~id2~0 != ~id3~0; 1525#L385 assume ~id1~0 >= 0; 1579#L386 assume ~id2~0 >= 0; 1493#L387 assume ~id3~0 >= 0; 1494#L388 assume 0 == ~r1~0; 1572#L389 assume 0 == ~r2~0; 1573#L390 assume 0 == ~r3~0; 1603#L391 assume 0 != init_~r122~0 % 256; 1538#L392 assume 0 != init_~r132~0 % 256; 1539#L393 assume 0 != init_~r212~0 % 256; 1598#L394 assume 0 != init_~r232~0 % 256; 1522#L395 assume 0 != init_~r312~0 % 256; 1523#L396 assume 0 != init_~r322~0 % 256; 1578#L397 assume ~max1~0 == ~id1~0; 1488#L398 assume ~max2~0 == ~id2~0; 1489#L399 assume ~max3~0 == ~id3~0; 1570#L400 assume 0 == ~st1~0; 1571#L401 assume 0 == ~st2~0; 1602#L402 assume 0 == ~st3~0; 1536#L403 assume 0 == ~nl1~0; 1537#L404 assume 0 == ~nl2~0; 1597#L405 assume 0 == ~nl3~0; 1520#L406 assume 0 == ~mode1~0 % 256; 1521#L407 assume 0 == ~mode2~0 % 256; 1577#L408 assume 0 == ~mode3~0 % 256; 1486#L409 assume 0 != ~newmax1~0 % 256; 1487#L410 assume 0 != ~newmax2~0 % 256; 1568#L411 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 1569#L382-1 init_#res := init_~tmp___5~0; 1625#L503 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1619#L66 assume !(0 == assume_abort_if_not_~cond); 1513#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1514#L614-2 [2020-07-29 03:21:16,837 INFO L796 eck$LassoCheckResult]: Loop: 1514#L614-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1633#L127 assume !(0 != ~mode1~0 % 256); 1632#L155 assume ~r1~0 < 2; 1631#L156 assume !(0 != ~ep12~0 % 256); 1519#L156-1 assume !(0 != ~ep13~0 % 256); 1586#L155-1 ~mode1~0 := 1; 1676#L127-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1675#L178 assume !(0 != ~mode2~0 % 256); 1668#L206 assume !(~r2~0 < 2); 1662#L206-1 ~mode2~0 := 1; 1661#L178-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1656#L229 assume !(0 != ~mode3~0 % 256); 1649#L257 assume !(~r3~0 < 2); 1645#L257-1 ~mode3~0 := 1; 1644#L229-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1643#L511 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1642#L512 assume ~st1~0 + ~nl1~0 <= 1; 1641#L513 assume ~st2~0 + ~nl2~0 <= 1; 1640#L514 assume ~st3~0 + ~nl3~0 <= 1; 1639#L515 assume !(~r1~0 >= 2); 1587#L518 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1588#L519 assume ~r1~0 < 2; 1635#L524 assume !(~r1~0 >= 2); 1627#L528 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1628#L529 assume ~r1~0 < 2;check_~tmp~1 := 1; 1638#L511-1 check_#res := check_~tmp~1; 1637#L559 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1636#L644 assume !(0 == assert_~arg % 256); 1634#L639 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1514#L614-2 [2020-07-29 03:21:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2020-07-29 03:21:16,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:16,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868813978] [2020-07-29 03:21:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:21:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1983288549, now seen corresponding path program 1 times [2020-07-29 03:21:16,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:16,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067233350] [2020-07-29 03:21:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:21:16,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:21:16,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:21:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2100705208, now seen corresponding path program 1 times [2020-07-29 03:21:16,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:21:16,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191458070] [2020-07-29 03:21:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:21:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:17,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {2078#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {2078#true} is VALID [2020-07-29 03:21:17,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {2078#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {2078#true} is VALID [2020-07-29 03:21:17,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {2078#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {2078#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {2078#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {2078#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {2078#true} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,097 INFO L280 TraceCheckUtils]: 7: Hoare triple {2078#true} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {2078#true} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,101 INFO L280 TraceCheckUtils]: 9: Hoare triple {2078#true} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {2078#true} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {2078#true} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {2078#true} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2078#true} is VALID [2020-07-29 03:21:17,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {2078#true} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2078#true} is VALID [2020-07-29 03:21:17,102 INFO L280 TraceCheckUtils]: 14: Hoare triple {2078#true} assume ~id1~0 != ~id2~0; {2078#true} is VALID [2020-07-29 03:21:17,102 INFO L280 TraceCheckUtils]: 15: Hoare triple {2078#true} assume ~id1~0 != ~id3~0; {2078#true} is VALID [2020-07-29 03:21:17,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {2078#true} assume ~id2~0 != ~id3~0; {2078#true} is VALID [2020-07-29 03:21:17,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {2078#true} assume ~id1~0 >= 0; {2078#true} is VALID [2020-07-29 03:21:17,103 INFO L280 TraceCheckUtils]: 18: Hoare triple {2078#true} assume ~id2~0 >= 0; {2078#true} is VALID [2020-07-29 03:21:17,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {2078#true} assume ~id3~0 >= 0; {2078#true} is VALID [2020-07-29 03:21:17,104 INFO L280 TraceCheckUtils]: 20: Hoare triple {2078#true} assume 0 == ~r1~0; {2078#true} is VALID [2020-07-29 03:21:17,105 INFO L280 TraceCheckUtils]: 21: Hoare triple {2078#true} assume 0 == ~r2~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,108 INFO L280 TraceCheckUtils]: 22: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~r3~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r122~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r132~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r212~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,111 INFO L280 TraceCheckUtils]: 26: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r232~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,111 INFO L280 TraceCheckUtils]: 27: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r312~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != init_~r322~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,112 INFO L280 TraceCheckUtils]: 29: Hoare triple {2080#(= 0 ~r2~0)} assume ~max1~0 == ~id1~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,113 INFO L280 TraceCheckUtils]: 30: Hoare triple {2080#(= 0 ~r2~0)} assume ~max2~0 == ~id2~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,114 INFO L280 TraceCheckUtils]: 31: Hoare triple {2080#(= 0 ~r2~0)} assume ~max3~0 == ~id3~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,114 INFO L280 TraceCheckUtils]: 32: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~st1~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,115 INFO L280 TraceCheckUtils]: 33: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~st2~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,116 INFO L280 TraceCheckUtils]: 34: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~st3~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,116 INFO L280 TraceCheckUtils]: 35: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~nl1~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,117 INFO L280 TraceCheckUtils]: 36: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~nl2~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,117 INFO L280 TraceCheckUtils]: 37: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~nl3~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,118 INFO L280 TraceCheckUtils]: 38: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~mode1~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,118 INFO L280 TraceCheckUtils]: 39: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~mode2~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,119 INFO L280 TraceCheckUtils]: 40: Hoare triple {2080#(= 0 ~r2~0)} assume 0 == ~mode3~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,119 INFO L280 TraceCheckUtils]: 41: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != ~newmax1~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,120 INFO L280 TraceCheckUtils]: 42: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != ~newmax2~0 % 256; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,121 INFO L280 TraceCheckUtils]: 43: Hoare triple {2080#(= 0 ~r2~0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,121 INFO L280 TraceCheckUtils]: 44: Hoare triple {2080#(= 0 ~r2~0)} init_#res := init_~tmp___5~0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,122 INFO L280 TraceCheckUtils]: 45: Hoare triple {2080#(= 0 ~r2~0)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,122 INFO L280 TraceCheckUtils]: 46: Hoare triple {2080#(= 0 ~r2~0)} assume !(0 == assume_abort_if_not_~cond); {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,123 INFO L280 TraceCheckUtils]: 47: Hoare triple {2080#(= 0 ~r2~0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,123 INFO L280 TraceCheckUtils]: 48: Hoare triple {2080#(= 0 ~r2~0)} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,124 INFO L280 TraceCheckUtils]: 49: Hoare triple {2080#(= 0 ~r2~0)} assume !(0 != ~mode1~0 % 256); {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,124 INFO L280 TraceCheckUtils]: 50: Hoare triple {2080#(= 0 ~r2~0)} assume ~r1~0 < 2; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,125 INFO L280 TraceCheckUtils]: 51: Hoare triple {2080#(= 0 ~r2~0)} assume !(0 != ~ep12~0 % 256); {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,125 INFO L280 TraceCheckUtils]: 52: Hoare triple {2080#(= 0 ~r2~0)} assume !(0 != ~ep13~0 % 256); {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,126 INFO L280 TraceCheckUtils]: 53: Hoare triple {2080#(= 0 ~r2~0)} ~mode1~0 := 1; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,127 INFO L280 TraceCheckUtils]: 54: Hoare triple {2080#(= 0 ~r2~0)} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,138 INFO L280 TraceCheckUtils]: 55: Hoare triple {2080#(= 0 ~r2~0)} assume !(0 != ~mode2~0 % 256); {2080#(= 0 ~r2~0)} is VALID [2020-07-29 03:21:17,140 INFO L280 TraceCheckUtils]: 56: Hoare triple {2080#(= 0 ~r2~0)} assume !(~r2~0 < 2); {2079#false} is VALID [2020-07-29 03:21:17,141 INFO L280 TraceCheckUtils]: 57: Hoare triple {2079#false} ~mode2~0 := 1; {2079#false} is VALID [2020-07-29 03:21:17,141 INFO L280 TraceCheckUtils]: 58: Hoare triple {2079#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {2079#false} is VALID [2020-07-29 03:21:17,141 INFO L280 TraceCheckUtils]: 59: Hoare triple {2079#false} assume !(0 != ~mode3~0 % 256); {2079#false} is VALID [2020-07-29 03:21:17,141 INFO L280 TraceCheckUtils]: 60: Hoare triple {2079#false} assume !(~r3~0 < 2); {2079#false} is VALID [2020-07-29 03:21:17,142 INFO L280 TraceCheckUtils]: 61: Hoare triple {2079#false} ~mode3~0 := 1; {2079#false} is VALID [2020-07-29 03:21:17,142 INFO L280 TraceCheckUtils]: 62: Hoare triple {2079#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2079#false} is VALID [2020-07-29 03:21:17,142 INFO L280 TraceCheckUtils]: 63: Hoare triple {2079#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2079#false} is VALID [2020-07-29 03:21:17,142 INFO L280 TraceCheckUtils]: 64: Hoare triple {2079#false} assume ~st1~0 + ~nl1~0 <= 1; {2079#false} is VALID [2020-07-29 03:21:17,143 INFO L280 TraceCheckUtils]: 65: Hoare triple {2079#false} assume ~st2~0 + ~nl2~0 <= 1; {2079#false} is VALID [2020-07-29 03:21:17,143 INFO L280 TraceCheckUtils]: 66: Hoare triple {2079#false} assume ~st3~0 + ~nl3~0 <= 1; {2079#false} is VALID [2020-07-29 03:21:17,143 INFO L280 TraceCheckUtils]: 67: Hoare triple {2079#false} assume !(~r1~0 >= 2); {2079#false} is VALID [2020-07-29 03:21:17,143 INFO L280 TraceCheckUtils]: 68: Hoare triple {2079#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2079#false} is VALID [2020-07-29 03:21:17,143 INFO L280 TraceCheckUtils]: 69: Hoare triple {2079#false} assume ~r1~0 < 2; {2079#false} is VALID [2020-07-29 03:21:17,144 INFO L280 TraceCheckUtils]: 70: Hoare triple {2079#false} assume !(~r1~0 >= 2); {2079#false} is VALID [2020-07-29 03:21:17,144 INFO L280 TraceCheckUtils]: 71: Hoare triple {2079#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2079#false} is VALID [2020-07-29 03:21:17,144 INFO L280 TraceCheckUtils]: 72: Hoare triple {2079#false} assume ~r1~0 < 2;check_~tmp~1 := 1; {2079#false} is VALID [2020-07-29 03:21:17,145 INFO L280 TraceCheckUtils]: 73: Hoare triple {2079#false} check_#res := check_~tmp~1; {2079#false} is VALID [2020-07-29 03:21:17,145 INFO L280 TraceCheckUtils]: 74: Hoare triple {2079#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2079#false} is VALID [2020-07-29 03:21:17,146 INFO L280 TraceCheckUtils]: 75: Hoare triple {2079#false} assume !(0 == assert_~arg % 256); {2079#false} is VALID [2020-07-29 03:21:17,146 INFO L280 TraceCheckUtils]: 76: Hoare triple {2079#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {2079#false} is VALID [2020-07-29 03:21:17,153 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 03:21:17,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191458070] [2020-07-29 03:21:17,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:21:17,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:21:17,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081145250] [2020-07-29 03:21:17,475 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2020-07-29 03:21:17,796 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2020-07-29 03:21:17,812 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:21:17,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:21:17,813 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:21:17,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:21:17,813 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:21:17,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:17,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:21:17,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:21:17,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:21:17,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:21:17,814 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:21:17,889 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 03:21:17,905 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 03:21:17,913 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 03:21:17,919 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 03:21:17,933 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 03:21:17,939 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 03:21:17,950 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 03:21:17,955 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 03:21:17,959 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 03:21:17,964 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 03:21:17,969 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 03:21:17,971 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 03:21:17,980 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 03:21:17,984 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 03:21:17,988 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 03:21:17,991 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 03:21:18,005 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 03:21:18,021 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 03:21:18,029 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 03:21:18,034 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 03:21:18,065 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 03:21:18,068 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 03:21:18,074 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 03:21:18,078 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 03:21:18,083 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 03:21:18,096 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 03:21:18,100 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 03:21:18,104 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 03:21:18,108 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 03:21:18,113 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 03:21:19,153 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:21:19,154 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 03:21:19,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:21:19,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:21:19,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:21:19,178 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:19,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:21:19,206 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 03:21:19,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:21:19,264 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 [2020-07-29 03:21:19,411 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:21:19,413 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:21:19,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:21:19,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:21:19,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:21:19,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:21:19,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:19,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:21:19,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:21:19,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:21:19,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:21:19,414 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:21:19,448 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 03:21:19,453 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 03:21:19,461 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 03:21:19,465 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 03:21:19,479 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 03:21:19,487 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 03:21:19,493 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 03:21:19,500 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 03:21:19,504 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 03:21:19,508 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 03:21:19,512 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 03:21:19,515 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 03:21:19,518 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 03:21:19,522 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 03:21:19,526 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 03:21:19,530 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 03:21:19,537 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 03:21:19,544 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 03:21:19,552 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 03:21:19,556 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 03:21:19,560 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 03:21:19,564 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 03:21:19,570 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 03:21:19,575 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 03:21:19,579 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 03:21:19,582 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 03:21:19,589 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 03:21:19,593 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 03:21:19,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:21:19,622 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 03:21:20,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:21:20,547 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,554 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 03:21:20,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,564 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:21:20,602 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 03:21:20,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,608 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 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 03:21:20,637 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 03:21:20,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:21:20,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:21:20,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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,669 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 03:21:20,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,681 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,718 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 03:21:20,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,725 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,758 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 03:21:20,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:21:20,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:21:20,775 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,797 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 03:21:20,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,804 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,866 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 03:21:20,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,871 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,895 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 03:21:20,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,898 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,919 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 03:21:20,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,923 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:20,949 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 03:21:20,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,957 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 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 03:21:20,984 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 03:21:20,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:20,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:20,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:20,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:20,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:20,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:20,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:20,991 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 03:21:21,016 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 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:21,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:21,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:21,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:21,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:21,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:21,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:21,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:21,021 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:21,043 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 03:21:21,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:21,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:21,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:21,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:21,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:21,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:21,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:21,046 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 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 03:21:21,069 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 03:21:21,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:21,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:21,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:21,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:21,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:21:21,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:21:21,077 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:21,099 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 03:21:21,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:21,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:21,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:21,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:21,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:21,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:21,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:21,106 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:21:21,130 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 03:21:21,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:21:21,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:21:21,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:21:21,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:21:21,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:21:21,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:21:21,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:21:21,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:21:21,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:21:21,152 INFO L444 ModelExtractionUtils]: 0 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 03:21:21,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:21:21,158 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:21:21,158 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:21:21,159 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-07-29 03:21:21,202 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:21:21,209 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38;" [2020-07-29 03:21:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:21:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:21,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:21:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:21,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:21:21,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {2081#unseeded} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {2081#unseeded} is VALID [2020-07-29 03:21:21,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {2081#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {2081#unseeded} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {2081#unseeded} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {2081#unseeded} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {2081#unseeded} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {2081#unseeded} assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {2081#unseeded} init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {2081#unseeded} assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {2081#unseeded} init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {2081#unseeded} assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {2081#unseeded} init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {2081#unseeded} assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,461 INFO L280 TraceCheckUtils]: 13: Hoare triple {2081#unseeded} init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2081#unseeded} is VALID [2020-07-29 03:21:21,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {2081#unseeded} assume ~id1~0 != ~id2~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {2081#unseeded} assume ~id1~0 != ~id3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {2081#unseeded} assume ~id2~0 != ~id3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {2081#unseeded} assume ~id1~0 >= 0; {2081#unseeded} is VALID [2020-07-29 03:21:21,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {2081#unseeded} assume ~id2~0 >= 0; {2081#unseeded} is VALID [2020-07-29 03:21:21,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {2081#unseeded} assume ~id3~0 >= 0; {2081#unseeded} is VALID [2020-07-29 03:21:21,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {2081#unseeded} assume 0 == ~r1~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {2081#unseeded} assume 0 == ~r2~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {2081#unseeded} assume 0 == ~r3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {2081#unseeded} assume 0 != init_~r122~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,474 INFO L280 TraceCheckUtils]: 24: Hoare triple {2081#unseeded} assume 0 != init_~r132~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {2081#unseeded} assume 0 != init_~r212~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,476 INFO L280 TraceCheckUtils]: 26: Hoare triple {2081#unseeded} assume 0 != init_~r232~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,476 INFO L280 TraceCheckUtils]: 27: Hoare triple {2081#unseeded} assume 0 != init_~r312~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,477 INFO L280 TraceCheckUtils]: 28: Hoare triple {2081#unseeded} assume 0 != init_~r322~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,478 INFO L280 TraceCheckUtils]: 29: Hoare triple {2081#unseeded} assume ~max1~0 == ~id1~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,479 INFO L280 TraceCheckUtils]: 30: Hoare triple {2081#unseeded} assume ~max2~0 == ~id2~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,479 INFO L280 TraceCheckUtils]: 31: Hoare triple {2081#unseeded} assume ~max3~0 == ~id3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,480 INFO L280 TraceCheckUtils]: 32: Hoare triple {2081#unseeded} assume 0 == ~st1~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,480 INFO L280 TraceCheckUtils]: 33: Hoare triple {2081#unseeded} assume 0 == ~st2~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,481 INFO L280 TraceCheckUtils]: 34: Hoare triple {2081#unseeded} assume 0 == ~st3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,481 INFO L280 TraceCheckUtils]: 35: Hoare triple {2081#unseeded} assume 0 == ~nl1~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,483 INFO L280 TraceCheckUtils]: 36: Hoare triple {2081#unseeded} assume 0 == ~nl2~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,483 INFO L280 TraceCheckUtils]: 37: Hoare triple {2081#unseeded} assume 0 == ~nl3~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,484 INFO L280 TraceCheckUtils]: 38: Hoare triple {2081#unseeded} assume 0 == ~mode1~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,484 INFO L280 TraceCheckUtils]: 39: Hoare triple {2081#unseeded} assume 0 == ~mode2~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,485 INFO L280 TraceCheckUtils]: 40: Hoare triple {2081#unseeded} assume 0 == ~mode3~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,486 INFO L280 TraceCheckUtils]: 41: Hoare triple {2081#unseeded} assume 0 != ~newmax1~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,486 INFO L280 TraceCheckUtils]: 42: Hoare triple {2081#unseeded} assume 0 != ~newmax2~0 % 256; {2081#unseeded} is VALID [2020-07-29 03:21:21,487 INFO L280 TraceCheckUtils]: 43: Hoare triple {2081#unseeded} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; {2081#unseeded} is VALID [2020-07-29 03:21:21,487 INFO L280 TraceCheckUtils]: 44: Hoare triple {2081#unseeded} init_#res := init_~tmp___5~0; {2081#unseeded} is VALID [2020-07-29 03:21:21,488 INFO L280 TraceCheckUtils]: 45: Hoare triple {2081#unseeded} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2081#unseeded} is VALID [2020-07-29 03:21:21,488 INFO L280 TraceCheckUtils]: 46: Hoare triple {2081#unseeded} assume !(0 == assume_abort_if_not_~cond); {2081#unseeded} is VALID [2020-07-29 03:21:21,489 INFO L280 TraceCheckUtils]: 47: Hoare triple {2081#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; {2081#unseeded} is VALID [2020-07-29 03:21:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:21,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:21:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:21:21,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:21:21,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {2084#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode1~0 % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~ep12~0 % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~ep13~0 % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode1~0 := 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,621 INFO L280 TraceCheckUtils]: 7: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode2~0 % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r2~0 < 2); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,622 INFO L280 TraceCheckUtils]: 9: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode2~0 := 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 != ~mode3~0 % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r3~0 < 2); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode3~0 := 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,628 INFO L280 TraceCheckUtils]: 15: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,629 INFO L280 TraceCheckUtils]: 16: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~nl1~0 <= 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st2~0 + ~nl2~0 <= 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st3~0 + ~nl3~0 <= 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,633 INFO L280 TraceCheckUtils]: 20: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,634 INFO L280 TraceCheckUtils]: 21: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,637 INFO L280 TraceCheckUtils]: 22: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 2); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,637 INFO L280 TraceCheckUtils]: 23: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,641 INFO L280 TraceCheckUtils]: 24: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 2;check_~tmp~1 := 1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,643 INFO L280 TraceCheckUtils]: 25: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} check_#res := check_~tmp~1; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,644 INFO L280 TraceCheckUtils]: 26: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,645 INFO L280 TraceCheckUtils]: 27: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 == assert_~arg % 256); {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:21:21,651 INFO L280 TraceCheckUtils]: 28: Hoare triple {2240#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {2094#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))) unseeded)} is VALID [2020-07-29 03:21:21,651 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 03:21:21,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:21:21,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:21,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:21,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:21,697 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 03:21:21,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94 Second operand 3 states. [2020-07-29 03:21:22,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94. Second operand 3 states. Result 329 states and 498 transitions. Complement of second has 4 states. [2020-07-29 03:21:22,105 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 03:21:22,105 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:21:22,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. cyclomatic complexity: 94 [2020-07-29 03:21:22,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:22,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:22,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:21:22,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:21:22,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:21:22,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:21:22,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 498 transitions. [2020-07-29 03:21:22,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:22,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:22,129 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 195 states and 288 transitions. cyclomatic complexity: 94 [2020-07-29 03:21:22,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 135 examples of accepted words. [2020-07-29 03:21:22,245 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:21:22,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:21:22,249 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:21:22,249 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:22,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:22,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:22,249 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:21:22,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 329 letters. Loop has 329 letters. [2020-07-29 03:21:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 329 letters. Loop has 329 letters. [2020-07-29 03:21:22,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 329 letters. Loop has 329 letters. [2020-07-29 03:21:22,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 195 letters. Loop has 195 letters. [2020-07-29 03:21:22,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 195 letters. Loop has 195 letters. [2020-07-29 03:21:22,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 195 letters. Loop has 195 letters. [2020-07-29 03:21:22,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:22,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:22,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:21:22,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:22,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:22,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 30 letters. [2020-07-29 03:21:22,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:22,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:22,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:21:22,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:22,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:22,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:21:22,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:22,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:22,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 77 letters. Loop has 27 letters. [2020-07-29 03:21:22,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:22,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:22,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:21:22,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:22,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:22,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 27 letters. [2020-07-29 03:21:22,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:22,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:22,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 27 letters. [2020-07-29 03:21:22,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:21:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:21:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:22,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:22,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:21:22,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:22,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:22,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:21:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:21:22,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:22,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:22,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:21:22,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:22,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:22,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:21:22,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:22,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:22,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:21:22,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:22,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:22,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:21:22,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:22,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:22,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:21:22,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:22,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:22,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:21:22,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:22,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:22,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:21:22,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:22,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:22,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 27 letters. [2020-07-29 03:21:22,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:22,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:22,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 27 letters. [2020-07-29 03:21:22,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:22,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:22,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:21:22,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:22,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:22,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 27 letters. [2020-07-29 03:21:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:22,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:21:22,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:22,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:22,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 27 letters. [2020-07-29 03:21:22,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:22,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:22,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 27 letters. [2020-07-29 03:21:22,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:22,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:22,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:21:22,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2020-07-29 03:21:22,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:22,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:22,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:21:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:22,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:21:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:21:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2020-07-29 03:21:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:21:22,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:22,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:21:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:21:22,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:22,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:22,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:21:22,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2020-07-29 03:21:22,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:22,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:22,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:21:22,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:22,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:22,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:21:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:21:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:22,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:21:22,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:21:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:22,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:21:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:21:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:21:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:22,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:21:22,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:22,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:22,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:21:22,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:22,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:22,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:21:22,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:22,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:21:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:22,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:22,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:21:22,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:22,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:21:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:21:22,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:22,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:22,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:21:22,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:22,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:22,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:21:22,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:22,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:22,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:21:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:21:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:22,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:21:22,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:21:22,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:22,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:22,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:21:22,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:22,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:22,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:21:22,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:21:22,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:21:22,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:21:22,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:21:22,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:21:22,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:22,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:22,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:21:22,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:22,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:22,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:21:22,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:22,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:22,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:21:22,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:22,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:22,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:21:22,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:21:22,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:22,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:22,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:21:22,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:21:22,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:21:22,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:21:22,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:22,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:22,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:21:22,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:22,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:22,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:21:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:22,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:22,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:21:22,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:22,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:22,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2020-07-29 03:21:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:21:22,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:22,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:21:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:21:22,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:21:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2020-07-29 03:21:22,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:21:22,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:21:22,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:22,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:22,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:21:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:21:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 27 letters. [2020-07-29 03:21:22,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:22,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:22,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 27 letters. [2020-07-29 03:21:22,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:21:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:22,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:22,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:21:22,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:22,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:22,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 27 letters. [2020-07-29 03:21:22,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 27 letters. [2020-07-29 03:21:22,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:22,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:22,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:21:22,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:21:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:21:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:21:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:21:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:21:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:21:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:21:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:21:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:21:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:21:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,501 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:21:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:21:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-29 03:21:22,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:21:22,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:21:22,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 58 letters. [2020-07-29 03:21:22,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:21:22,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2020-07-29 03:21:22,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:22,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2020-07-29 03:21:22,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:21:22,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:21:22,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:21:22,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:22,523 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:22,523 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:22,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:21:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:21:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:21:22,526 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:21:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:21:22,526 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:21:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:21:22,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:21:22,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:21:22,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:21:22,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:22,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:21:22,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:21:22,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:21:22,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:21:22,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:21:22,614 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:22,615 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:22,615 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:21:22,615 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:21:22,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:21:22,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:21:22,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:21:22,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:21:22 BoogieIcfgContainer [2020-07-29 03:21:22,623 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:21:22,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:21:22,623 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:21:22,624 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:21:22,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:21:13" (3/4) ... [2020-07-29 03:21:22,627 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:21:22,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:21:22,630 INFO L168 Benchmark]: Toolchain (without parser) took 11034.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 956.2 MB in the beginning and 992.8 MB in the end (delta: -36.6 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:22,631 INFO L168 Benchmark]: CDTParser took 0.26 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 03:21:22,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:22,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.47 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.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:22,637 INFO L168 Benchmark]: Boogie Preprocessor took 56.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:21:22,639 INFO L168 Benchmark]: RCFGBuilder took 1175.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:22,639 INFO L168 Benchmark]: BuchiAutomizer took 9171.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 216.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:21:22,640 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 992.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:21:22,649 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.26 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 532.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.47 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.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1175.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9171.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 216.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 992.8 MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 195 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 869 SDtfs, 282 SDslu, 1669 SDs, 0 SdLazy, 45 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...