./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.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_lcr.8.ufo.BOUNDED-16.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 dadd02723d2e6f2e27124dfc254055916c5e086a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:20,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:20:20,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:20:20,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:20:20,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:20:20,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:20:20,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:20:20,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:20:20,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:20:20,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:20:20,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:20:20,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:20:20,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:20:20,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:20:20,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:20:20,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:20:20,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:20:20,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:20:20,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:20:20,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:20:20,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:20:20,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:20:20,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:20:20,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:20:20,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:20:20,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:20:20,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:20:20,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:20:20,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:20:20,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:20:20,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:20:20,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:20:20,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:20:20,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:20:20,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:20:20,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:20:20,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:20:20,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:20:20,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:20:20,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:20:20,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:20:20,255 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:20:20,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:20:20,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:20:20,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:20:20,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:20:20,274 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:20:20,274 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:20:20,274 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:20:20,275 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:20:20,275 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:20:20,275 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:20:20,276 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:20:20,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:20:20,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:20:20,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:20:20,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:20:20,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:20:20,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:20:20,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:20:20,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:20:20,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:20:20,278 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:20:20,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:20:20,279 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:20:20,279 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:20:20,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:20:20,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:20:20,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:20:20,280 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:20:20,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:20:20,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:20:20,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:20:20,281 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:20:20,282 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:20:20,283 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 -> dadd02723d2e6f2e27124dfc254055916c5e086a [2020-07-29 03:20:20,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:20:20,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:20:20,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:20:20,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:20:20,651 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:20:20,652 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-07-29 03:20:20,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0f14f01/e4c7030e0e29433b8d5114636888f79e/FLAG4bda0abed [2020-07-29 03:20:21,283 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:20:21,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-07-29 03:20:21,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0f14f01/e4c7030e0e29433b8d5114636888f79e/FLAG4bda0abed [2020-07-29 03:20:21,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0f14f01/e4c7030e0e29433b8d5114636888f79e [2020-07-29 03:20:21,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:20:21,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:20:21,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:21,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:20:21,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:20:21,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:21" (1/1) ... [2020-07-29 03:20:21,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f922af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:21, skipping insertion in model container [2020-07-29 03:20:21,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:21" (1/1) ... [2020-07-29 03:20:21,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:20:21,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:20:22,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:22,091 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:20:22,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:22,199 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:20:22,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22 WrapperNode [2020-07-29 03:20:22,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:22,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:22,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:20:22,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:20:22,211 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:20:22" (1/1) ... [2020-07-29 03:20:22,224 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:20:22" (1/1) ... [2020-07-29 03:20:22,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:22,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:20:22,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:20:22,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:20:22,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (1/1) ... [2020-07-29 03:20:22,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:20:22,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:20:22,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:20:22,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:20:22,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (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:20:22,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:20:22,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:20:23,592 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:20:23,593 INFO L295 CfgBuilder]: Removed 29 assume(true) statements. [2020-07-29 03:20:23,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:23 BoogieIcfgContainer [2020-07-29 03:20:23,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:20:23,599 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:20:23,600 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:20:23,603 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:20:23,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:23,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:20:21" (1/3) ... [2020-07-29 03:20:23,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4baa208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:23, skipping insertion in model container [2020-07-29 03:20:23,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:23,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:22" (2/3) ... [2020-07-29 03:20:23,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4baa208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:23, skipping insertion in model container [2020-07-29 03:20:23,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:23,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:23" (3/3) ... [2020-07-29 03:20:23,610 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals.c [2020-07-29 03:20:23,662 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:20:23,663 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:20:23,663 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:20:23,663 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:20:23,664 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:20:23,664 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:20:23,664 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:20:23,664 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:20:23,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2020-07-29 03:20:23,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:20:23,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:23,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:23,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:23,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:23,753 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:20:23,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2020-07-29 03:20:23,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-07-29 03:20:23,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:23,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:23,781 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:23,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:23,790 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 13#L-1true havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 14#L340true assume !(0 == ~r1~0);init_~tmp~0 := 0; 17#L340-1true init_#res := init_~tmp~0; 15#L585true main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; 54#L67true assume !(0 == assume_abort_if_not_~cond); 107#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 65#L675-2true [2020-07-29 03:20:23,800 INFO L796 eck$LassoCheckResult]: Loop: 65#L675-2true assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 119#L137true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 77#L141true assume !(node1_~m1~0 != ~nomsg~0); 76#L141-1true ~mode1~0 := 0; 111#L137-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 78#L163true assume !(0 != ~mode2~0 % 256); 99#L176true assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite1 := ~p2_new~0; 108#L176-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 75#L163-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 46#L188true assume !(0 != ~mode3~0 % 256); 82#L201true assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite2 := ~p3_new~0; 80#L201-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 43#L188-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 51#L213true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 38#L216true assume !(node4_~m4~0 != ~nomsg~0); 35#L216-1true ~mode4~0 := 0; 23#L213-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 40#L238true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 10#L241true assume !(node5_~m5~0 != ~nomsg~0); 5#L241-1true ~mode5~0 := 0; 33#L238-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 12#L263true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 16#L266true assume !(node6_~m6~0 != ~nomsg~0); 137#L266-1true ~mode6~0 := 0; 3#L263-2true havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 18#L288true assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 144#L291true assume !(node7_~m7~0 != ~nomsg~0); 140#L291-1true ~mode7~0 := 0; 136#L288-2true havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 132#L313true assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 128#L316true assume !(node8_~m8~0 != ~nomsg~0); 129#L316-1true ~mode8~0 := 0; 134#L313-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 36#L593true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 39#L593-1true check_#res := check_~tmp~1; 146#L613true main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 48#L714true assume !(0 == assert_~arg % 256); 20#L709true main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 65#L675-2true [2020-07-29 03:20:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2020-07-29 03:20:23,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:23,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165904059] [2020-07-29 03:20:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:24,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {150#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {150#true} is VALID [2020-07-29 03:20:24,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {150#true} havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {150#true} is VALID [2020-07-29 03:20:24,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {152#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:20:24,208 INFO L280 TraceCheckUtils]: 3: Hoare triple {152#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {153#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:20:24,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {153#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; {154#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:20:24,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {154#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {151#false} is VALID [2020-07-29 03:20:24,211 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; {151#false} is VALID [2020-07-29 03:20:24,214 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:20:24,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165904059] [2020-07-29 03:20:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:24,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:24,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865405268] [2020-07-29 03:20:24,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:20:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash -249407439, now seen corresponding path program 1 times [2020-07-29 03:20:24,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:24,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669087324] [2020-07-29 03:20:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:24,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume !(node1_~m1~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {155#true} ~mode1~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {155#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {155#true} assume !(0 != ~mode2~0 % 256); {155#true} is VALID [2020-07-29 03:20:24,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {155#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite1 := ~p2_new~0; {155#true} is VALID [2020-07-29 03:20:24,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {155#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {155#true} is VALID [2020-07-29 03:20:24,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {155#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {155#true} assume !(0 != ~mode3~0 % 256); {155#true} is VALID [2020-07-29 03:20:24,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {155#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite2 := ~p3_new~0; {155#true} is VALID [2020-07-29 03:20:24,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {155#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {155#true} is VALID [2020-07-29 03:20:24,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {155#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,508 INFO L280 TraceCheckUtils]: 13: Hoare triple {155#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,509 INFO L280 TraceCheckUtils]: 14: Hoare triple {155#true} assume !(node4_~m4~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {155#true} ~mode4~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {155#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {155#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {155#true} assume !(node5_~m5~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {155#true} ~mode5~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,511 INFO L280 TraceCheckUtils]: 20: Hoare triple {155#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {155#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {155#true} assume !(node6_~m6~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {155#true} ~mode6~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {155#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,514 INFO L280 TraceCheckUtils]: 25: Hoare triple {155#true} assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,514 INFO L280 TraceCheckUtils]: 26: Hoare triple {155#true} assume !(node7_~m7~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {155#true} ~mode7~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,515 INFO L280 TraceCheckUtils]: 28: Hoare triple {155#true} havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,515 INFO L280 TraceCheckUtils]: 29: Hoare triple {155#true} assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {155#true} is VALID [2020-07-29 03:20:24,516 INFO L280 TraceCheckUtils]: 30: Hoare triple {155#true} assume !(node8_~m8~0 != ~nomsg~0); {155#true} is VALID [2020-07-29 03:20:24,517 INFO L280 TraceCheckUtils]: 31: Hoare triple {155#true} ~mode8~0 := 0; {155#true} is VALID [2020-07-29 03:20:24,517 INFO L280 TraceCheckUtils]: 32: Hoare triple {155#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {155#true} is VALID [2020-07-29 03:20:24,519 INFO L280 TraceCheckUtils]: 33: Hoare triple {155#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; {157#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:20:24,520 INFO L280 TraceCheckUtils]: 34: Hoare triple {157#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {158#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:20:24,523 INFO L280 TraceCheckUtils]: 35: Hoare triple {158#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {159#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:20:24,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {159#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {156#false} is VALID [2020-07-29 03:20:24,525 INFO L280 TraceCheckUtils]: 37: Hoare triple {156#false} main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; {156#false} is VALID [2020-07-29 03:20:24,532 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:20:24,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669087324] [2020-07-29 03:20:24,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:24,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:24,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702880252] [2020-07-29 03:20:24,536 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:24,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:24,556 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2020-07-29 03:20:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:25,467 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2020-07-29 03:20:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:25,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:25,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:25,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2020-07-29 03:20:25,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-07-29 03:20:25,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2020-07-29 03:20:25,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-07-29 03:20:25,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-07-29 03:20:25,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2020-07-29 03:20:25,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:25,523 INFO L688 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-07-29 03:20:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2020-07-29 03:20:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-07-29 03:20:25,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:25,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 186 transitions. Second operand 141 states. [2020-07-29 03:20:25,564 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 186 transitions. Second operand 141 states. [2020-07-29 03:20:25,565 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand 141 states. [2020-07-29 03:20:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:25,575 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2020-07-29 03:20:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2020-07-29 03:20:25,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:25,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:25,578 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 141 states and 186 transitions. [2020-07-29 03:20:25,578 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 141 states and 186 transitions. [2020-07-29 03:20:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:25,587 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2020-07-29 03:20:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2020-07-29 03:20:25,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:25,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:25,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:25,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-29 03:20:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2020-07-29 03:20:25,599 INFO L711 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-07-29 03:20:25,599 INFO L591 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2020-07-29 03:20:25,599 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:20:25,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2020-07-29 03:20:25,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-07-29 03:20:25,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:25,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:25,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:25,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:25,606 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 334#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 335#L340 assume 0 == ~r1~0; 336#L341 assume ~id1~0 >= 0; 421#L342 assume 0 == ~st1~0; 329#L343 assume ~send1~0 == ~id1~0; 330#L344 assume 0 == ~mode1~0 % 256; 387#L345 assume ~id2~0 >= 0; 388#L346 assume 0 == ~st2~0; 440#L347 assume ~send2~0 == ~id2~0; 374#L348 assume 0 == ~mode2~0 % 256; 375#L349 assume ~id3~0 >= 0; 426#L350 assume 0 == ~st3~0; 363#L351 assume ~send3~0 == ~id3~0; 364#L352 assume 0 == ~mode3~0 % 256; 417#L353 assume ~id4~0 >= 0; 327#L354 assume 0 == ~st4~0; 328#L355 assume ~send4~0 == ~id4~0; 384#L356 assume 0 == ~mode4~0 % 256; 385#L357 assume ~id5~0 >= 0; 439#L358 assume 0 == ~st5~0; 371#L359 assume ~send5~0 == ~id5~0; 372#L360 assume 0 == ~mode5~0 % 256; 425#L361 assume ~id6~0 >= 0; 361#L362 assume 0 == ~st6~0; 362#L363 assume ~send6~0 == ~id6~0; 416#L364 assume 0 == ~mode6~0 % 256; 323#L365 assume ~id7~0 >= 0; 324#L366 assume 0 == ~st7~0; 408#L367 assume ~send7~0 == ~id7~0; 409#L368 assume 0 == ~mode7~0 % 256; 438#L369 assume ~id8~0 >= 0; 369#L370 assume 0 == ~st8~0; 370#L371 assume ~send8~0 == ~id8~0; 424#L372 assume 0 == ~mode8~0 % 256; 359#L373 assume ~id1~0 != ~id2~0; 360#L374 assume ~id1~0 != ~id3~0; 413#L375 assume ~id1~0 != ~id4~0; 321#L376 assume ~id1~0 != ~id5~0; 322#L377 assume ~id1~0 != ~id6~0; 406#L378 assume ~id1~0 != ~id7~0; 407#L379 assume ~id1~0 != ~id8~0; 437#L380 assume ~id2~0 != ~id3~0; 367#L381 assume ~id2~0 != ~id4~0; 368#L382 assume ~id2~0 != ~id5~0; 434#L383 assume ~id2~0 != ~id6~0; 355#L384 assume ~id2~0 != ~id7~0; 356#L385 assume ~id2~0 != ~id8~0; 412#L386 assume ~id3~0 != ~id4~0; 319#L387 assume ~id3~0 != ~id5~0; 320#L388 assume ~id3~0 != ~id6~0; 404#L389 assume ~id3~0 != ~id7~0; 405#L390 assume ~id3~0 != ~id8~0; 436#L391 assume ~id4~0 != ~id5~0; 365#L392 assume ~id4~0 != ~id6~0; 366#L393 assume ~id4~0 != ~id7~0; 433#L394 assume ~id4~0 != ~id8~0; 351#L395 assume ~id5~0 != ~id6~0; 352#L396 assume ~id5~0 != ~id7~0; 411#L397 assume ~id5~0 != ~id8~0; 315#L398 assume ~id6~0 != ~id7~0; 316#L399 assume ~id6~0 != ~id8~0; 402#L400 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 343#L340-1 init_#res := init_~tmp~0; 339#L585 main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; 340#L67 assume !(0 == assume_abort_if_not_~cond); 403#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 345#L675-2 [2020-07-29 03:20:25,607 INFO L796 eck$LassoCheckResult]: Loop: 345#L675-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 418#L137 assume !(0 != ~mode1~0 % 256); 448#L151 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 449#L151-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 428#L137-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 430#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 391#L166 assume !(node2_~m2~0 != ~nomsg~0); 389#L166-1 ~mode2~0 := 0; 390#L163-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 393#L188 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 394#L191 assume !(node3_~m3~0 != ~nomsg~0); 357#L191-1 ~mode3~0 := 0; 358#L188-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 386#L213 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 380#L216 assume !(node4_~m4~0 != ~nomsg~0); 373#L216-1 ~mode4~0 := 0; 353#L213-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 354#L238 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 325#L241 assume !(node5_~m5~0 != ~nomsg~0); 317#L241-1 ~mode5~0 := 0; 318#L238-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 331#L263 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 332#L266 assume !(node6_~m6~0 != ~nomsg~0); 337#L266-1 ~mode6~0 := 0; 313#L263-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 314#L288 assume !(0 != ~mode7~0 % 256); 341#L301 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 400#L301-2 ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 401#L288-2 havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 452#L313 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 450#L316 assume !(node8_~m8~0 != ~nomsg~0); 423#L316-1 ~mode8~0 := 0; 350#L313-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 376#L593 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 377#L593-1 check_#res := check_~tmp~1; 382#L613 main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 397#L714 assume !(0 == assert_~arg % 256); 344#L709 main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 345#L675-2 [2020-07-29 03:20:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2020-07-29 03:20:25,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:25,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309571810] [2020-07-29 03:20:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:25,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:25,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:25,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1234029237, now seen corresponding path program 1 times [2020-07-29 03:20:25,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:25,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881815177] [2020-07-29 03:20:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:25,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {741#true} assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {741#true} assume !(0 != ~mode1~0 % 256); {741#true} is VALID [2020-07-29 03:20:25,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {741#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; {741#true} is VALID [2020-07-29 03:20:25,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {741#true} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {741#true} is VALID [2020-07-29 03:20:25,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {741#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {741#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {741#true} assume !(node2_~m2~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {741#true} ~mode2~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {741#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {741#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,904 INFO L280 TraceCheckUtils]: 10: Hoare triple {741#true} assume !(node3_~m3~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {741#true} ~mode3~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {741#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {741#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {741#true} assume !(node4_~m4~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {741#true} ~mode4~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {741#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,907 INFO L280 TraceCheckUtils]: 17: Hoare triple {741#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,907 INFO L280 TraceCheckUtils]: 18: Hoare triple {741#true} assume !(node5_~m5~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,908 INFO L280 TraceCheckUtils]: 19: Hoare triple {741#true} ~mode5~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,908 INFO L280 TraceCheckUtils]: 20: Hoare triple {741#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,908 INFO L280 TraceCheckUtils]: 21: Hoare triple {741#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {741#true} assume !(node6_~m6~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,909 INFO L280 TraceCheckUtils]: 23: Hoare triple {741#true} ~mode6~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,942 INFO L280 TraceCheckUtils]: 24: Hoare triple {741#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,943 INFO L280 TraceCheckUtils]: 25: Hoare triple {741#true} assume !(0 != ~mode7~0 % 256); {741#true} is VALID [2020-07-29 03:20:25,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {741#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {741#true} is VALID [2020-07-29 03:20:25,943 INFO L280 TraceCheckUtils]: 27: Hoare triple {741#true} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {741#true} is VALID [2020-07-29 03:20:25,944 INFO L280 TraceCheckUtils]: 28: Hoare triple {741#true} havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,945 INFO L280 TraceCheckUtils]: 29: Hoare triple {741#true} assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {741#true} is VALID [2020-07-29 03:20:25,945 INFO L280 TraceCheckUtils]: 30: Hoare triple {741#true} assume !(node8_~m8~0 != ~nomsg~0); {741#true} is VALID [2020-07-29 03:20:25,945 INFO L280 TraceCheckUtils]: 31: Hoare triple {741#true} ~mode8~0 := 0; {741#true} is VALID [2020-07-29 03:20:25,946 INFO L280 TraceCheckUtils]: 32: Hoare triple {741#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {741#true} is VALID [2020-07-29 03:20:25,948 INFO L280 TraceCheckUtils]: 33: Hoare triple {741#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; {743#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:20:25,950 INFO L280 TraceCheckUtils]: 34: Hoare triple {743#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {744#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:20:25,951 INFO L280 TraceCheckUtils]: 35: Hoare triple {744#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {745#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:20:25,953 INFO L280 TraceCheckUtils]: 36: Hoare triple {745#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {742#false} is VALID [2020-07-29 03:20:25,953 INFO L280 TraceCheckUtils]: 37: Hoare triple {742#false} main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; {742#false} is VALID [2020-07-29 03:20:25,955 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:20:25,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881815177] [2020-07-29 03:20:25,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:25,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:25,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022846403] [2020-07-29 03:20:25,957 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:25,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:25,958 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-07-29 03:20:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:26,593 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2020-07-29 03:20:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:26,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:26,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:26,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2020-07-29 03:20:26,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-07-29 03:20:26,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2020-07-29 03:20:26,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-07-29 03:20:26,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-07-29 03:20:26,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2020-07-29 03:20:26,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:26,663 INFO L688 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-07-29 03:20:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2020-07-29 03:20:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-07-29 03:20:26,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:26,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 183 transitions. Second operand 141 states. [2020-07-29 03:20:26,671 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 183 transitions. Second operand 141 states. [2020-07-29 03:20:26,671 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 141 states. [2020-07-29 03:20:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:26,677 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2020-07-29 03:20:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2020-07-29 03:20:26,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:26,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:26,679 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 141 states and 183 transitions. [2020-07-29 03:20:26,679 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 141 states and 183 transitions. [2020-07-29 03:20:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:26,684 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2020-07-29 03:20:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2020-07-29 03:20:26,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:26,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:26,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:26,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-29 03:20:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2020-07-29 03:20:26,691 INFO L711 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-07-29 03:20:26,692 INFO L591 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2020-07-29 03:20:26,692 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:20:26,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2020-07-29 03:20:26,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2020-07-29 03:20:26,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:26,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:26,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:26,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:26,697 INFO L794 eck$LassoCheckResult]: Stem: 1027#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 915#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 916#L340 assume 0 == ~r1~0; 917#L341 assume ~id1~0 >= 0; 1002#L342 assume 0 == ~st1~0; 910#L343 assume ~send1~0 == ~id1~0; 911#L344 assume 0 == ~mode1~0 % 256; 968#L345 assume ~id2~0 >= 0; 969#L346 assume 0 == ~st2~0; 1021#L347 assume ~send2~0 == ~id2~0; 955#L348 assume 0 == ~mode2~0 % 256; 956#L349 assume ~id3~0 >= 0; 1007#L350 assume 0 == ~st3~0; 944#L351 assume ~send3~0 == ~id3~0; 945#L352 assume 0 == ~mode3~0 % 256; 999#L353 assume ~id4~0 >= 0; 908#L354 assume 0 == ~st4~0; 909#L355 assume ~send4~0 == ~id4~0; 965#L356 assume 0 == ~mode4~0 % 256; 966#L357 assume ~id5~0 >= 0; 1020#L358 assume 0 == ~st5~0; 952#L359 assume ~send5~0 == ~id5~0; 953#L360 assume 0 == ~mode5~0 % 256; 1006#L361 assume ~id6~0 >= 0; 942#L362 assume 0 == ~st6~0; 943#L363 assume ~send6~0 == ~id6~0; 995#L364 assume 0 == ~mode6~0 % 256; 904#L365 assume ~id7~0 >= 0; 905#L366 assume 0 == ~st7~0; 989#L367 assume ~send7~0 == ~id7~0; 990#L368 assume 0 == ~mode7~0 % 256; 1019#L369 assume ~id8~0 >= 0; 950#L370 assume 0 == ~st8~0; 951#L371 assume ~send8~0 == ~id8~0; 1005#L372 assume 0 == ~mode8~0 % 256; 938#L373 assume ~id1~0 != ~id2~0; 939#L374 assume ~id1~0 != ~id3~0; 994#L375 assume ~id1~0 != ~id4~0; 902#L376 assume ~id1~0 != ~id5~0; 903#L377 assume ~id1~0 != ~id6~0; 987#L378 assume ~id1~0 != ~id7~0; 988#L379 assume ~id1~0 != ~id8~0; 1018#L380 assume ~id2~0 != ~id3~0; 948#L381 assume ~id2~0 != ~id4~0; 949#L382 assume ~id2~0 != ~id5~0; 1015#L383 assume ~id2~0 != ~id6~0; 934#L384 assume ~id2~0 != ~id7~0; 935#L385 assume ~id2~0 != ~id8~0; 993#L386 assume ~id3~0 != ~id4~0; 898#L387 assume ~id3~0 != ~id5~0; 899#L388 assume ~id3~0 != ~id6~0; 985#L389 assume ~id3~0 != ~id7~0; 986#L390 assume ~id3~0 != ~id8~0; 1017#L391 assume ~id4~0 != ~id5~0; 946#L392 assume ~id4~0 != ~id6~0; 947#L393 assume ~id4~0 != ~id7~0; 1014#L394 assume ~id4~0 != ~id8~0; 932#L395 assume ~id5~0 != ~id6~0; 933#L396 assume ~id5~0 != ~id7~0; 992#L397 assume ~id5~0 != ~id8~0; 894#L398 assume ~id6~0 != ~id7~0; 895#L399 assume ~id6~0 != ~id8~0; 983#L400 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 922#L340-1 init_#res := init_~tmp~0; 918#L585 main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; 919#L67 assume !(0 == assume_abort_if_not_~cond); 984#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 929#L675-2 [2020-07-29 03:20:26,697 INFO L796 eck$LassoCheckResult]: Loop: 929#L675-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 998#L137 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1010#L141 assume !(node1_~m1~0 != ~nomsg~0); 926#L141-1 ~mode1~0 := 0; 1009#L137-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1011#L163 assume !(0 != ~mode2~0 % 256); 1012#L176 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite1 := ~p2_new~0; 1024#L176-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 971#L163-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 974#L188 assume !(0 != ~mode3~0 % 256); 976#L201 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite2 := ~p3_new~0; 1013#L201-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 941#L188-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 967#L213 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 960#L216 assume !(node4_~m4~0 != ~nomsg~0); 954#L216-1 ~mode4~0 := 0; 936#L213-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 937#L238 assume !(0 != ~mode5~0 % 256); 964#L251 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 991#L251-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 901#L238-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 912#L263 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 913#L266 assume !(node6_~m6~0 != ~nomsg~0); 920#L266-1 ~mode6~0 := 0; 896#L263-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 897#L288 assume !(0 != ~mode7~0 % 256); 923#L301 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 981#L301-2 ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 982#L288-2 havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1033#L313 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1031#L316 assume !(node8_~m8~0 != ~nomsg~0); 1004#L316-1 ~mode8~0 := 0; 931#L313-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 957#L593 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 958#L594 assume ~r1~0 >= 8; 1000#L598 assume ~r1~0 < 8;check_~tmp~1 := 1; 962#L593-1 check_#res := check_~tmp~1; 963#L613 main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 978#L714 assume !(0 == assert_~arg % 256); 928#L709 main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 929#L675-2 [2020-07-29 03:20:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2020-07-29 03:20:26,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:26,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033573540] [2020-07-29 03:20:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:26,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:26,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:26,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1564624173, now seen corresponding path program 1 times [2020-07-29 03:20:26,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:26,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533859011] [2020-07-29 03:20:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:26,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {1322#true} assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {1322#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} assume !(node1_~m1~0 != ~nomsg~0); {1322#true} is VALID [2020-07-29 03:20:26,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} ~mode1~0 := 0; {1322#true} is VALID [2020-07-29 03:20:26,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {1322#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {1322#true} assume !(0 != ~mode2~0 % 256); {1322#true} is VALID [2020-07-29 03:20:26,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {1322#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite1 := ~p2_new~0; {1322#true} is VALID [2020-07-29 03:20:26,927 INFO L280 TraceCheckUtils]: 7: Hoare triple {1322#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {1322#true} is VALID [2020-07-29 03:20:26,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {1322#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {1322#true} assume !(0 != ~mode3~0 % 256); {1322#true} is VALID [2020-07-29 03:20:26,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {1322#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite2 := ~p3_new~0; {1322#true} is VALID [2020-07-29 03:20:26,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {1322#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {1322#true} is VALID [2020-07-29 03:20:26,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {1322#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,929 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#true} assume !(node4_~m4~0 != ~nomsg~0); {1322#true} is VALID [2020-07-29 03:20:26,930 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#true} ~mode4~0 := 0; {1322#true} is VALID [2020-07-29 03:20:26,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#true} assume !(0 != ~mode5~0 % 256); {1322#true} is VALID [2020-07-29 03:20:26,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; {1322#true} is VALID [2020-07-29 03:20:26,931 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#true} ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; {1322#true} is VALID [2020-07-29 03:20:26,932 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,932 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,932 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#true} assume !(node6_~m6~0 != ~nomsg~0); {1322#true} is VALID [2020-07-29 03:20:26,933 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#true} ~mode6~0 := 0; {1322#true} is VALID [2020-07-29 03:20:26,933 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,933 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#true} assume !(0 != ~mode7~0 % 256); {1322#true} is VALID [2020-07-29 03:20:26,934 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {1322#true} is VALID [2020-07-29 03:20:26,934 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#true} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {1322#true} is VALID [2020-07-29 03:20:26,934 INFO L280 TraceCheckUtils]: 28: Hoare triple {1322#true} havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,935 INFO L280 TraceCheckUtils]: 29: Hoare triple {1322#true} assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1322#true} is VALID [2020-07-29 03:20:26,935 INFO L280 TraceCheckUtils]: 30: Hoare triple {1322#true} assume !(node8_~m8~0 != ~nomsg~0); {1322#true} is VALID [2020-07-29 03:20:26,935 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#true} ~mode8~0 := 0; {1322#true} is VALID [2020-07-29 03:20:26,936 INFO L280 TraceCheckUtils]: 32: Hoare triple {1322#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1322#true} is VALID [2020-07-29 03:20:26,936 INFO L280 TraceCheckUtils]: 33: Hoare triple {1322#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {1322#true} is VALID [2020-07-29 03:20:26,937 INFO L280 TraceCheckUtils]: 34: Hoare triple {1322#true} assume ~r1~0 >= 8; {1324#(< 7 ~r1~0)} is VALID [2020-07-29 03:20:26,938 INFO L280 TraceCheckUtils]: 35: Hoare triple {1324#(< 7 ~r1~0)} assume ~r1~0 < 8;check_~tmp~1 := 1; {1323#false} is VALID [2020-07-29 03:20:26,939 INFO L280 TraceCheckUtils]: 36: Hoare triple {1323#false} check_#res := check_~tmp~1; {1323#false} is VALID [2020-07-29 03:20:26,939 INFO L280 TraceCheckUtils]: 37: Hoare triple {1323#false} main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1323#false} is VALID [2020-07-29 03:20:26,939 INFO L280 TraceCheckUtils]: 38: Hoare triple {1323#false} assume !(0 == assert_~arg % 256); {1323#false} is VALID [2020-07-29 03:20:26,939 INFO L280 TraceCheckUtils]: 39: Hoare triple {1323#false} main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; {1323#false} is VALID [2020-07-29 03:20:26,941 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:20:26,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533859011] [2020-07-29 03:20:26,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:26,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:26,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659518677] [2020-07-29 03:20:26,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:26,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:20:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:20:26,944 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand 3 states. [2020-07-29 03:20:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:27,332 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-07-29 03:20:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:20:27,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:27,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:27,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-07-29 03:20:27,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2020-07-29 03:20:27,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2020-07-29 03:20:27,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2020-07-29 03:20:27,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:27,419 INFO L688 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-07-29 03:20:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-07-29 03:20:27,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:27,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states and 288 transitions. Second operand 209 states. [2020-07-29 03:20:27,443 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states and 288 transitions. Second operand 209 states. [2020-07-29 03:20:27,444 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand 209 states. [2020-07-29 03:20:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:27,452 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-07-29 03:20:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:27,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:27,453 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 209 states and 288 transitions. [2020-07-29 03:20:27,453 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 209 states and 288 transitions. [2020-07-29 03:20:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:27,461 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2020-07-29 03:20:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:27,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:27,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:27,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-29 03:20:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2020-07-29 03:20:27,472 INFO L711 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-07-29 03:20:27,472 INFO L591 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2020-07-29 03:20:27,472 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:20:27,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2020-07-29 03:20:27,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2020-07-29 03:20:27,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:27,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:27,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:27,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:27,484 INFO L794 eck$LassoCheckResult]: Stem: 1667#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 1555#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1556#L340 assume 0 == ~r1~0; 1557#L341 assume ~id1~0 >= 0; 1640#L342 assume 0 == ~st1~0; 1550#L343 assume ~send1~0 == ~id1~0; 1551#L344 assume 0 == ~mode1~0 % 256; 1607#L345 assume ~id2~0 >= 0; 1608#L346 assume 0 == ~st2~0; 1661#L347 assume ~send2~0 == ~id2~0; 1594#L348 assume 0 == ~mode2~0 % 256; 1595#L349 assume ~id3~0 >= 0; 1647#L350 assume 0 == ~st3~0; 1584#L351 assume ~send3~0 == ~id3~0; 1585#L352 assume 0 == ~mode3~0 % 256; 1638#L353 assume ~id4~0 >= 0; 1546#L354 assume 0 == ~st4~0; 1547#L355 assume ~send4~0 == ~id4~0; 1605#L356 assume 0 == ~mode4~0 % 256; 1606#L357 assume ~id5~0 >= 0; 1660#L358 assume 0 == ~st5~0; 1592#L359 assume ~send5~0 == ~id5~0; 1593#L360 assume 0 == ~mode5~0 % 256; 1646#L361 assume ~id6~0 >= 0; 1582#L362 assume 0 == ~st6~0; 1583#L363 assume ~send6~0 == ~id6~0; 1635#L364 assume 0 == ~mode6~0 % 256; 1544#L365 assume ~id7~0 >= 0; 1545#L366 assume 0 == ~st7~0; 1629#L367 assume ~send7~0 == ~id7~0; 1630#L368 assume 0 == ~mode7~0 % 256; 1659#L369 assume ~id8~0 >= 0; 1590#L370 assume 0 == ~st8~0; 1591#L371 assume ~send8~0 == ~id8~0; 1645#L372 assume 0 == ~mode8~0 % 256; 1578#L373 assume ~id1~0 != ~id2~0; 1579#L374 assume ~id1~0 != ~id3~0; 1634#L375 assume ~id1~0 != ~id4~0; 1542#L376 assume ~id1~0 != ~id5~0; 1543#L377 assume ~id1~0 != ~id6~0; 1627#L378 assume ~id1~0 != ~id7~0; 1628#L379 assume ~id1~0 != ~id8~0; 1658#L380 assume ~id2~0 != ~id3~0; 1588#L381 assume ~id2~0 != ~id4~0; 1589#L382 assume ~id2~0 != ~id5~0; 1655#L383 assume ~id2~0 != ~id6~0; 1574#L384 assume ~id2~0 != ~id7~0; 1575#L385 assume ~id2~0 != ~id8~0; 1633#L386 assume ~id3~0 != ~id4~0; 1538#L387 assume ~id3~0 != ~id5~0; 1539#L388 assume ~id3~0 != ~id6~0; 1625#L389 assume ~id3~0 != ~id7~0; 1626#L390 assume ~id3~0 != ~id8~0; 1657#L391 assume ~id4~0 != ~id5~0; 1586#L392 assume ~id4~0 != ~id6~0; 1587#L393 assume ~id4~0 != ~id7~0; 1654#L394 assume ~id4~0 != ~id8~0; 1572#L395 assume ~id5~0 != ~id6~0; 1573#L396 assume ~id5~0 != ~id7~0; 1632#L397 assume ~id5~0 != ~id8~0; 1534#L398 assume ~id6~0 != ~id7~0; 1535#L399 assume ~id6~0 != ~id8~0; 1623#L400 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 1562#L340-1 init_#res := init_~tmp~0; 1558#L585 main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; 1559#L67 assume !(0 == assume_abort_if_not_~cond); 1624#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 1668#L675-2 [2020-07-29 03:20:27,485 INFO L796 eck$LassoCheckResult]: Loop: 1668#L675-2 assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1738#L137 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1650#L141 assume !(node1_~m1~0 != ~nomsg~0); 1566#L141-1 ~mode1~0 := 0; 1649#L137-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1735#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1732#L166 assume !(node2_~m2~0 != ~nomsg~0); 1730#L166-1 ~mode2~0 := 0; 1728#L163-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1727#L188 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1724#L191 assume !(node3_~m3~0 != ~nomsg~0); 1722#L191-1 ~mode3~0 := 0; 1720#L188-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1719#L213 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1716#L216 assume !(node4_~m4~0 != ~nomsg~0); 1714#L216-1 ~mode4~0 := 0; 1712#L213-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1711#L238 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1709#L241 assume !(node5_~m5~0 != ~nomsg~0); 1706#L241-1 ~mode5~0 := 0; 1704#L238-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1703#L263 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1701#L266 assume !(node6_~m6~0 != ~nomsg~0); 1698#L266-1 ~mode6~0 := 0; 1696#L263-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1695#L288 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1693#L291 assume !(node7_~m7~0 != ~nomsg~0); 1690#L291-1 ~mode7~0 := 0; 1688#L288-2 havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1687#L313 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1685#L316 assume !(node8_~m8~0 != ~nomsg~0); 1682#L316-1 ~mode8~0 := 0; 1680#L313-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1679#L593 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1678#L594 assume !(~r1~0 >= 8); 1670#L597 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1671#L598 assume ~r1~0 < 8;check_~tmp~1 := 1; 1742#L593-1 check_#res := check_~tmp~1; 1741#L613 main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1740#L714 assume !(0 == assert_~arg % 256); 1739#L709 main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 1668#L675-2 [2020-07-29 03:20:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2020-07-29 03:20:27,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:27,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523485631] [2020-07-29 03:20:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:27,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:27,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:27,619 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash -149374161, now seen corresponding path program 1 times [2020-07-29 03:20:27,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:27,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723595828] [2020-07-29 03:20:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:27,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:27,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:27,665 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -969886864, now seen corresponding path program 1 times [2020-07-29 03:20:27,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:27,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445761179] [2020-07-29 03:20:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:27,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {2168#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {2168#true} is VALID [2020-07-29 03:20:27,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {2168#true} havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {2168#true} is VALID [2020-07-29 03:20:27,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {2168#true} assume 0 == ~r1~0; {2168#true} is VALID [2020-07-29 03:20:27,819 INFO L280 TraceCheckUtils]: 3: Hoare triple {2168#true} assume ~id1~0 >= 0; {2168#true} is VALID [2020-07-29 03:20:27,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {2168#true} assume 0 == ~st1~0; {2168#true} is VALID [2020-07-29 03:20:27,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {2168#true} assume ~send1~0 == ~id1~0; {2168#true} is VALID [2020-07-29 03:20:27,822 INFO L280 TraceCheckUtils]: 6: Hoare triple {2168#true} assume 0 == ~mode1~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,825 INFO L280 TraceCheckUtils]: 9: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,826 INFO L280 TraceCheckUtils]: 10: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,827 INFO L280 TraceCheckUtils]: 11: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,827 INFO L280 TraceCheckUtils]: 12: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,828 INFO L280 TraceCheckUtils]: 13: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,829 INFO L280 TraceCheckUtils]: 14: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,829 INFO L280 TraceCheckUtils]: 15: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,830 INFO L280 TraceCheckUtils]: 16: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,832 INFO L280 TraceCheckUtils]: 17: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,834 INFO L280 TraceCheckUtils]: 19: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,834 INFO L280 TraceCheckUtils]: 20: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,835 INFO L280 TraceCheckUtils]: 21: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,838 INFO L280 TraceCheckUtils]: 23: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,840 INFO L280 TraceCheckUtils]: 24: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send6~0 == ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,841 INFO L280 TraceCheckUtils]: 26: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode6~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,842 INFO L280 TraceCheckUtils]: 27: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id7~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,843 INFO L280 TraceCheckUtils]: 28: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,843 INFO L280 TraceCheckUtils]: 29: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send7~0 == ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,844 INFO L280 TraceCheckUtils]: 30: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode7~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,845 INFO L280 TraceCheckUtils]: 31: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id8~0 >= 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,846 INFO L280 TraceCheckUtils]: 32: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,846 INFO L280 TraceCheckUtils]: 33: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send8~0 == ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,847 INFO L280 TraceCheckUtils]: 34: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode8~0 % 256; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,848 INFO L280 TraceCheckUtils]: 35: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,849 INFO L280 TraceCheckUtils]: 36: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,849 INFO L280 TraceCheckUtils]: 37: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,850 INFO L280 TraceCheckUtils]: 38: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,851 INFO L280 TraceCheckUtils]: 39: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,851 INFO L280 TraceCheckUtils]: 40: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,852 INFO L280 TraceCheckUtils]: 41: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,853 INFO L280 TraceCheckUtils]: 42: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,853 INFO L280 TraceCheckUtils]: 43: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,855 INFO L280 TraceCheckUtils]: 44: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,855 INFO L280 TraceCheckUtils]: 45: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,856 INFO L280 TraceCheckUtils]: 46: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,857 INFO L280 TraceCheckUtils]: 47: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,857 INFO L280 TraceCheckUtils]: 48: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,858 INFO L280 TraceCheckUtils]: 49: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,859 INFO L280 TraceCheckUtils]: 50: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,860 INFO L280 TraceCheckUtils]: 51: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,863 INFO L280 TraceCheckUtils]: 52: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,864 INFO L280 TraceCheckUtils]: 53: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,865 INFO L280 TraceCheckUtils]: 54: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,865 INFO L280 TraceCheckUtils]: 55: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,866 INFO L280 TraceCheckUtils]: 56: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,867 INFO L280 TraceCheckUtils]: 57: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id6~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,867 INFO L280 TraceCheckUtils]: 58: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,869 INFO L280 TraceCheckUtils]: 59: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,869 INFO L280 TraceCheckUtils]: 60: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 != ~id7~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,871 INFO L280 TraceCheckUtils]: 61: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 != ~id8~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,871 INFO L280 TraceCheckUtils]: 62: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,872 INFO L280 TraceCheckUtils]: 63: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,873 INFO L280 TraceCheckUtils]: 64: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,874 INFO L280 TraceCheckUtils]: 65: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,874 INFO L280 TraceCheckUtils]: 66: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,875 INFO L280 TraceCheckUtils]: 67: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:27,876 INFO L280 TraceCheckUtils]: 68: Hoare triple {2170#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,877 INFO L280 TraceCheckUtils]: 69: Hoare triple {2169#false} assume !(node1_~m1~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,877 INFO L280 TraceCheckUtils]: 70: Hoare triple {2169#false} ~mode1~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,877 INFO L280 TraceCheckUtils]: 71: Hoare triple {2169#false} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,877 INFO L280 TraceCheckUtils]: 72: Hoare triple {2169#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,878 INFO L280 TraceCheckUtils]: 73: Hoare triple {2169#false} assume !(node2_~m2~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,878 INFO L280 TraceCheckUtils]: 74: Hoare triple {2169#false} ~mode2~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,878 INFO L280 TraceCheckUtils]: 75: Hoare triple {2169#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,882 INFO L280 TraceCheckUtils]: 76: Hoare triple {2169#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,882 INFO L280 TraceCheckUtils]: 77: Hoare triple {2169#false} assume !(node3_~m3~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,882 INFO L280 TraceCheckUtils]: 78: Hoare triple {2169#false} ~mode3~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,882 INFO L280 TraceCheckUtils]: 79: Hoare triple {2169#false} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,883 INFO L280 TraceCheckUtils]: 80: Hoare triple {2169#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,883 INFO L280 TraceCheckUtils]: 81: Hoare triple {2169#false} assume !(node4_~m4~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,883 INFO L280 TraceCheckUtils]: 82: Hoare triple {2169#false} ~mode4~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,883 INFO L280 TraceCheckUtils]: 83: Hoare triple {2169#false} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,883 INFO L280 TraceCheckUtils]: 84: Hoare triple {2169#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,884 INFO L280 TraceCheckUtils]: 85: Hoare triple {2169#false} assume !(node5_~m5~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,884 INFO L280 TraceCheckUtils]: 86: Hoare triple {2169#false} ~mode5~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,884 INFO L280 TraceCheckUtils]: 87: Hoare triple {2169#false} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,885 INFO L280 TraceCheckUtils]: 88: Hoare triple {2169#false} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,886 INFO L280 TraceCheckUtils]: 89: Hoare triple {2169#false} assume !(node6_~m6~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,886 INFO L280 TraceCheckUtils]: 90: Hoare triple {2169#false} ~mode6~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,886 INFO L280 TraceCheckUtils]: 91: Hoare triple {2169#false} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,887 INFO L280 TraceCheckUtils]: 92: Hoare triple {2169#false} assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,887 INFO L280 TraceCheckUtils]: 93: Hoare triple {2169#false} assume !(node7_~m7~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,888 INFO L280 TraceCheckUtils]: 94: Hoare triple {2169#false} ~mode7~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,888 INFO L280 TraceCheckUtils]: 95: Hoare triple {2169#false} havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,891 INFO L280 TraceCheckUtils]: 96: Hoare triple {2169#false} assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2169#false} is VALID [2020-07-29 03:20:27,892 INFO L280 TraceCheckUtils]: 97: Hoare triple {2169#false} assume !(node8_~m8~0 != ~nomsg~0); {2169#false} is VALID [2020-07-29 03:20:27,892 INFO L280 TraceCheckUtils]: 98: Hoare triple {2169#false} ~mode8~0 := 0; {2169#false} is VALID [2020-07-29 03:20:27,893 INFO L280 TraceCheckUtils]: 99: Hoare triple {2169#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2169#false} is VALID [2020-07-29 03:20:27,893 INFO L280 TraceCheckUtils]: 100: Hoare triple {2169#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {2169#false} is VALID [2020-07-29 03:20:27,893 INFO L280 TraceCheckUtils]: 101: Hoare triple {2169#false} assume !(~r1~0 >= 8); {2169#false} is VALID [2020-07-29 03:20:27,893 INFO L280 TraceCheckUtils]: 102: Hoare triple {2169#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {2169#false} is VALID [2020-07-29 03:20:27,894 INFO L280 TraceCheckUtils]: 103: Hoare triple {2169#false} assume ~r1~0 < 8;check_~tmp~1 := 1; {2169#false} is VALID [2020-07-29 03:20:27,894 INFO L280 TraceCheckUtils]: 104: Hoare triple {2169#false} check_#res := check_~tmp~1; {2169#false} is VALID [2020-07-29 03:20:27,894 INFO L280 TraceCheckUtils]: 105: Hoare triple {2169#false} main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2169#false} is VALID [2020-07-29 03:20:27,895 INFO L280 TraceCheckUtils]: 106: Hoare triple {2169#false} assume !(0 == assert_~arg % 256); {2169#false} is VALID [2020-07-29 03:20:27,895 INFO L280 TraceCheckUtils]: 107: Hoare triple {2169#false} main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; {2169#false} is VALID [2020-07-29 03:20:27,920 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:20:27,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445761179] [2020-07-29 03:20:27,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:27,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:27,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655842079] [2020-07-29 03:20:28,894 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 197 [2020-07-29 03:20:29,729 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 166 [2020-07-29 03:20:29,748 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:29,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:29,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:29,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:29,749 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:20:29,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:29,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:29,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:29,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-07-29 03:20:29,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:29,750 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:29,849 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:20:29,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:29,874 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:20:29,881 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:20:29,884 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:20:29,904 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:20:29,908 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:20:29,917 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:20:29,924 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:20:29,929 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:20:29,934 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:20:29,938 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:20:29,949 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:20:29,960 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:20:29,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:20:29,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:20:29,973 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:20:29,982 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:20:29,989 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:20:30,003 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:20:30,007 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:20:30,011 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:20:30,019 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:20:30,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:30,031 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:20:30,125 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:20:30,130 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:20:30,135 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:20:30,141 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:20:30,145 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:20:30,149 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:20:30,159 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:20:30,165 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:20:30,169 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:20:30,174 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:20:30,184 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:20:30,198 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:20:30,203 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:20:30,207 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:20:30,213 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:20:31,424 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-07-29 03:20:32,304 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-07-29 03:20:32,576 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:32,577 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:20:32,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:20:32,584 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:20:32,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:20:32,644 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:32,908 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:20:32,911 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:32,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:32,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:32,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:32,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:20:32,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:32,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:32,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:32,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2020-07-29 03:20:32,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:32,913 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:32,983 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:20:32,992 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:20:32,997 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:20:33,006 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:20:33,009 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:20:33,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:33,032 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:20:33,037 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:20:33,044 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:20:33,049 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:20:33,054 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:20:33,063 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:20:33,067 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:20:33,072 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:20:33,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:20:33,081 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:20:33,087 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:20:33,090 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:20:33,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:33,107 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:20:33,111 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:20:33,115 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:20:33,120 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:20:33,123 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:20:33,136 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:20:33,141 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:20:33,238 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:20:33,243 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:20:33,250 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:20:33,256 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:20:33,260 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:20:33,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:33,270 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:20:33,274 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:20:33,284 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:20:33,289 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:20:33,303 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:20:33,310 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:20:33,316 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:20:33,320 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:20:34,454 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-07-29 03:20:34,875 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-07-29 03:20:35,300 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-07-29 03:20:35,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:35,559 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:35,566 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:20:35,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,578 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 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:20:35,620 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:20:35,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:35,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:35,630 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:35,656 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:20:35,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,668 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:20:35,700 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:20:35,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,705 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:20:35,729 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:20:35,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,730 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:20:35,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,733 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:20:35,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,740 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:20:35,764 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:20:35,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:35,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:35,772 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:20:35,796 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:20:35,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,800 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:20:35,824 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:20:35,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,831 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:20:35,856 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:20:35,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:35,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:35,864 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:20:35,887 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:20:35,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:35,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:35,895 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:20:35,918 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:20:35,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,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:20:35,947 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:20:35,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:35,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:35,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:35,951 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:20:35,976 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:20:35,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:35,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:35,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:35,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:35,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:35,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:35,992 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:36,035 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:20:36,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:36,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:36,043 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:20:36,080 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:20:36,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:36,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:36,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:36,083 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:20:36,108 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:20:36,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:36,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:36,115 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:20:36,140 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:20:36,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:36,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:36,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:36,143 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:20:36,165 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:20:36,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:36,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:36,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:36,172 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 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:20:36,196 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:20:36,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:36,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:36,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:36,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:36,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:36,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:36,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:36,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:20:36,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:20:36,211 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:20:36,221 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:20:36,221 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:20:36,221 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:20:36,222 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 31 Supporting invariants [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:36,281 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:20:36,292 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0 != ~nomsg~0);" "~mode6~0 := 0;" "havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0;" "assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0;" "assume !(node7_~m7~0 != ~nomsg~0);" "~mode7~0 := 0;" "havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0;" "assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0;" "assume !(node8_~m8~0 != ~nomsg~0);" "~mode8~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1;" "assume !(~r1~0 >= 8);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0;" "assume ~r1~0 < 8;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;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~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43;" [2020-07-29 03:20:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:36,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:20:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:36,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:20:36,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {2171#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {2171#unseeded} is VALID [2020-07-29 03:20:36,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {2171#unseeded} havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {2171#unseeded} assume 0 == ~r1~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,508 INFO L280 TraceCheckUtils]: 3: Hoare triple {2171#unseeded} assume ~id1~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {2171#unseeded} assume 0 == ~st1~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {2171#unseeded} assume ~send1~0 == ~id1~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {2171#unseeded} assume 0 == ~mode1~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,510 INFO L280 TraceCheckUtils]: 7: Hoare triple {2171#unseeded} assume ~id2~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {2171#unseeded} assume 0 == ~st2~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {2171#unseeded} assume ~send2~0 == ~id2~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {2171#unseeded} assume 0 == ~mode2~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {2171#unseeded} assume ~id3~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {2171#unseeded} assume 0 == ~st3~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {2171#unseeded} assume ~send3~0 == ~id3~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {2171#unseeded} assume 0 == ~mode3~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {2171#unseeded} assume ~id4~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {2171#unseeded} assume 0 == ~st4~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {2171#unseeded} assume ~send4~0 == ~id4~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {2171#unseeded} assume 0 == ~mode4~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,518 INFO L280 TraceCheckUtils]: 19: Hoare triple {2171#unseeded} assume ~id5~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {2171#unseeded} assume 0 == ~st5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {2171#unseeded} assume ~send5~0 == ~id5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {2171#unseeded} assume 0 == ~mode5~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {2171#unseeded} assume ~id6~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,522 INFO L280 TraceCheckUtils]: 24: Hoare triple {2171#unseeded} assume 0 == ~st6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,522 INFO L280 TraceCheckUtils]: 25: Hoare triple {2171#unseeded} assume ~send6~0 == ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,523 INFO L280 TraceCheckUtils]: 26: Hoare triple {2171#unseeded} assume 0 == ~mode6~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {2171#unseeded} assume ~id7~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,524 INFO L280 TraceCheckUtils]: 28: Hoare triple {2171#unseeded} assume 0 == ~st7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,525 INFO L280 TraceCheckUtils]: 29: Hoare triple {2171#unseeded} assume ~send7~0 == ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,525 INFO L280 TraceCheckUtils]: 30: Hoare triple {2171#unseeded} assume 0 == ~mode7~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {2171#unseeded} assume ~id8~0 >= 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {2171#unseeded} assume 0 == ~st8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,528 INFO L280 TraceCheckUtils]: 33: Hoare triple {2171#unseeded} assume ~send8~0 == ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,528 INFO L280 TraceCheckUtils]: 34: Hoare triple {2171#unseeded} assume 0 == ~mode8~0 % 256; {2171#unseeded} is VALID [2020-07-29 03:20:36,529 INFO L280 TraceCheckUtils]: 35: Hoare triple {2171#unseeded} assume ~id1~0 != ~id2~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {2171#unseeded} assume ~id1~0 != ~id3~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,531 INFO L280 TraceCheckUtils]: 37: Hoare triple {2171#unseeded} assume ~id1~0 != ~id4~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,531 INFO L280 TraceCheckUtils]: 38: Hoare triple {2171#unseeded} assume ~id1~0 != ~id5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,532 INFO L280 TraceCheckUtils]: 39: Hoare triple {2171#unseeded} assume ~id1~0 != ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,533 INFO L280 TraceCheckUtils]: 40: Hoare triple {2171#unseeded} assume ~id1~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,533 INFO L280 TraceCheckUtils]: 41: Hoare triple {2171#unseeded} assume ~id1~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,534 INFO L280 TraceCheckUtils]: 42: Hoare triple {2171#unseeded} assume ~id2~0 != ~id3~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,534 INFO L280 TraceCheckUtils]: 43: Hoare triple {2171#unseeded} assume ~id2~0 != ~id4~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,535 INFO L280 TraceCheckUtils]: 44: Hoare triple {2171#unseeded} assume ~id2~0 != ~id5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,536 INFO L280 TraceCheckUtils]: 45: Hoare triple {2171#unseeded} assume ~id2~0 != ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,536 INFO L280 TraceCheckUtils]: 46: Hoare triple {2171#unseeded} assume ~id2~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,537 INFO L280 TraceCheckUtils]: 47: Hoare triple {2171#unseeded} assume ~id2~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,537 INFO L280 TraceCheckUtils]: 48: Hoare triple {2171#unseeded} assume ~id3~0 != ~id4~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,538 INFO L280 TraceCheckUtils]: 49: Hoare triple {2171#unseeded} assume ~id3~0 != ~id5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,539 INFO L280 TraceCheckUtils]: 50: Hoare triple {2171#unseeded} assume ~id3~0 != ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,539 INFO L280 TraceCheckUtils]: 51: Hoare triple {2171#unseeded} assume ~id3~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,540 INFO L280 TraceCheckUtils]: 52: Hoare triple {2171#unseeded} assume ~id3~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,540 INFO L280 TraceCheckUtils]: 53: Hoare triple {2171#unseeded} assume ~id4~0 != ~id5~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,541 INFO L280 TraceCheckUtils]: 54: Hoare triple {2171#unseeded} assume ~id4~0 != ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,542 INFO L280 TraceCheckUtils]: 55: Hoare triple {2171#unseeded} assume ~id4~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,542 INFO L280 TraceCheckUtils]: 56: Hoare triple {2171#unseeded} assume ~id4~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,543 INFO L280 TraceCheckUtils]: 57: Hoare triple {2171#unseeded} assume ~id5~0 != ~id6~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,543 INFO L280 TraceCheckUtils]: 58: Hoare triple {2171#unseeded} assume ~id5~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,544 INFO L280 TraceCheckUtils]: 59: Hoare triple {2171#unseeded} assume ~id5~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,545 INFO L280 TraceCheckUtils]: 60: Hoare triple {2171#unseeded} assume ~id6~0 != ~id7~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,545 INFO L280 TraceCheckUtils]: 61: Hoare triple {2171#unseeded} assume ~id6~0 != ~id8~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,546 INFO L280 TraceCheckUtils]: 62: Hoare triple {2171#unseeded} assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; {2171#unseeded} is VALID [2020-07-29 03:20:36,546 INFO L280 TraceCheckUtils]: 63: Hoare triple {2171#unseeded} init_#res := init_~tmp~0; {2171#unseeded} is VALID [2020-07-29 03:20:36,547 INFO L280 TraceCheckUtils]: 64: Hoare triple {2171#unseeded} main_#t~ret41 := init_#res;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;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; {2171#unseeded} is VALID [2020-07-29 03:20:36,548 INFO L280 TraceCheckUtils]: 65: Hoare triple {2171#unseeded} assume !(0 == assume_abort_if_not_~cond); {2171#unseeded} is VALID [2020-07-29 03:20:36,548 INFO L280 TraceCheckUtils]: 66: Hoare triple {2171#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; {2171#unseeded} is VALID [2020-07-29 03:20:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:20:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:36,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:20:36,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {2174#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 31))} assume !!(main_~i2~0 < 16);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node1_~m1~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode1~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,707 INFO L280 TraceCheckUtils]: 5: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node2_~m2~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode2~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node3_~m3~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode3~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node4_~m4~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode4~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node5_~m5~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode5~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,717 INFO L280 TraceCheckUtils]: 22: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node6_~m6~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,718 INFO L280 TraceCheckUtils]: 23: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode6~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,718 INFO L280 TraceCheckUtils]: 24: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,719 INFO L280 TraceCheckUtils]: 25: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,719 INFO L280 TraceCheckUtils]: 26: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node7_~m7~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,720 INFO L280 TraceCheckUtils]: 27: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode7~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,720 INFO L280 TraceCheckUtils]: 28: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,721 INFO L280 TraceCheckUtils]: 29: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,723 INFO L280 TraceCheckUtils]: 30: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(node8_~m8~0 != ~nomsg~0); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,727 INFO L280 TraceCheckUtils]: 31: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~mode8~0 := 0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,729 INFO L280 TraceCheckUtils]: 32: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,730 INFO L280 TraceCheckUtils]: 33: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,731 INFO L280 TraceCheckUtils]: 34: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(~r1~0 >= 8); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,731 INFO L280 TraceCheckUtils]: 35: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,732 INFO L280 TraceCheckUtils]: 36: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume ~r1~0 < 8;check_~tmp~1 := 1; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,733 INFO L280 TraceCheckUtils]: 37: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} check_#res := check_~tmp~1; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,734 INFO L280 TraceCheckUtils]: 38: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} main_#t~ret42 := check_#res;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,735 INFO L280 TraceCheckUtils]: 39: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} assume !(0 == assert_~arg % 256); {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} is VALID [2020-07-29 03:20:36,736 INFO L280 TraceCheckUtils]: 40: Hoare triple {2387#(and (<= 31 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 16))} main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; {2184#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 31))) unseeded)} is VALID [2020-07-29 03:20:36,737 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:20:36,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:36,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:36,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:36,806 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:20:36,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-07-29 03:20:37,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80. Second operand 3 states. Result 350 states and 509 transitions. Complement of second has 4 states. [2020-07-29 03:20:37,205 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:20:37,205 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:20:37,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. cyclomatic complexity: 80 [2020-07-29 03:20:37,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:37,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:37,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:20:37,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:20:37,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:37,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:37,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 509 transitions. [2020-07-29 03:20:37,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:37,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:37,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 209 states and 288 transitions. cyclomatic complexity: 80 [2020-07-29 03:20:37,377 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 142 examples of accepted words. [2020-07-29 03:20:37,378 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:20:37,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:20:37,382 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:20:37,383 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 350 states and 509 transitions. cyclomatic complexity: 160 [2020-07-29 03:20:37,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 509 transitions. cyclomatic complexity: 160 [2020-07-29 03:20:37,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:37,383 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:20:37,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 350 letters. Loop has 350 letters. [2020-07-29 03:20:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 350 letters. Loop has 350 letters. [2020-07-29 03:20:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 350 letters. Loop has 350 letters. [2020-07-29 03:20:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 209 letters. Loop has 209 letters. [2020-07-29 03:20:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 209 letters. Loop has 209 letters. [2020-07-29 03:20:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 209 letters. Loop has 209 letters. [2020-07-29 03:20:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 132 letters. Loop has 41 letters. [2020-07-29 03:20:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 132 letters. Loop has 41 letters. [2020-07-29 03:20:37,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 132 letters. Loop has 41 letters. [2020-07-29 03:20:37,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 133 letters. Loop has 41 letters. [2020-07-29 03:20:37,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 133 letters. Loop has 41 letters. [2020-07-29 03:20:37,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 133 letters. Loop has 41 letters. [2020-07-29 03:20:37,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 128 letters. Loop has 41 letters. [2020-07-29 03:20:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 128 letters. Loop has 41 letters. [2020-07-29 03:20:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 128 letters. Loop has 41 letters. [2020-07-29 03:20:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 127 letters. Loop has 42 letters. [2020-07-29 03:20:37,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 127 letters. Loop has 42 letters. [2020-07-29 03:20:37,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 127 letters. Loop has 42 letters. [2020-07-29 03:20:37,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 129 letters. Loop has 41 letters. [2020-07-29 03:20:37,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 129 letters. Loop has 41 letters. [2020-07-29 03:20:37,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 129 letters. Loop has 41 letters. [2020-07-29 03:20:37,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 130 letters. Loop has 41 letters. [2020-07-29 03:20:37,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 131 letters. Loop has 42 letters. [2020-07-29 03:20:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 131 letters. Loop has 42 letters. [2020-07-29 03:20:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 131 letters. Loop has 42 letters. [2020-07-29 03:20:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 134 letters. Loop has 41 letters. [2020-07-29 03:20:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 70 letters. Loop has 42 letters. [2020-07-29 03:20:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 42 letters. [2020-07-29 03:20:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 70 letters. Loop has 42 letters. [2020-07-29 03:20:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 71 letters. Loop has 43 letters. [2020-07-29 03:20:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 43 letters. [2020-07-29 03:20:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 71 letters. Loop has 43 letters. [2020-07-29 03:20:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 108 letters. Loop has 41 letters. [2020-07-29 03:20:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 108 letters. Loop has 41 letters. [2020-07-29 03:20:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 108 letters. Loop has 41 letters. [2020-07-29 03:20:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 140 letters. Loop has 41 letters. [2020-07-29 03:20:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 140 letters. Loop has 41 letters. [2020-07-29 03:20:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 140 letters. Loop has 41 letters. [2020-07-29 03:20:37,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 124 letters. Loop has 41 letters. [2020-07-29 03:20:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 124 letters. Loop has 41 letters. [2020-07-29 03:20:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 124 letters. Loop has 41 letters. [2020-07-29 03:20:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 125 letters. Loop has 41 letters. [2020-07-29 03:20:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 125 letters. Loop has 41 letters. [2020-07-29 03:20:37,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 125 letters. Loop has 41 letters. [2020-07-29 03:20:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 120 letters. Loop has 41 letters. [2020-07-29 03:20:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 120 letters. Loop has 41 letters. [2020-07-29 03:20:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 120 letters. Loop has 41 letters. [2020-07-29 03:20:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 141 letters. Loop has 41 letters. [2020-07-29 03:20:37,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 141 letters. Loop has 41 letters. [2020-07-29 03:20:37,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 141 letters. Loop has 41 letters. [2020-07-29 03:20:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 142 letters. Loop has 41 letters. [2020-07-29 03:20:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 142 letters. Loop has 41 letters. [2020-07-29 03:20:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 142 letters. Loop has 41 letters. [2020-07-29 03:20:37,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 123 letters. Loop has 42 letters. [2020-07-29 03:20:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 42 letters. [2020-07-29 03:20:37,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 123 letters. Loop has 42 letters. [2020-07-29 03:20:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 126 letters. Loop has 41 letters. [2020-07-29 03:20:37,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 121 letters. Loop has 41 letters. [2020-07-29 03:20:37,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 121 letters. Loop has 41 letters. [2020-07-29 03:20:37,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 121 letters. Loop has 41 letters. [2020-07-29 03:20:37,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 116 letters. Loop has 41 letters. [2020-07-29 03:20:37,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 41 letters. [2020-07-29 03:20:37,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 116 letters. Loop has 41 letters. [2020-07-29 03:20:37,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 115 letters. Loop has 42 letters. [2020-07-29 03:20:37,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 42 letters. [2020-07-29 03:20:37,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 115 letters. Loop has 42 letters. [2020-07-29 03:20:37,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 117 letters. Loop has 41 letters. [2020-07-29 03:20:37,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 117 letters. Loop has 41 letters. [2020-07-29 03:20:37,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 117 letters. Loop has 41 letters. [2020-07-29 03:20:37,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 118 letters. Loop has 41 letters. [2020-07-29 03:20:37,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 131 letters. Loop has 41 letters. [2020-07-29 03:20:37,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 119 letters. Loop has 42 letters. [2020-07-29 03:20:37,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 119 letters. Loop has 42 letters. [2020-07-29 03:20:37,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 119 letters. Loop has 42 letters. [2020-07-29 03:20:37,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 122 letters. Loop has 41 letters. [2020-07-29 03:20:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 136 letters. Loop has 41 letters. [2020-07-29 03:20:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 136 letters. Loop has 41 letters. [2020-07-29 03:20:37,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 136 letters. Loop has 41 letters. [2020-07-29 03:20:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 127 letters. Loop has 41 letters. [2020-07-29 03:20:37,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 136 letters. Loop has 43 letters. [2020-07-29 03:20:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 136 letters. Loop has 43 letters. [2020-07-29 03:20:37,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 136 letters. Loop has 43 letters. [2020-07-29 03:20:37,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 135 letters. Loop has 41 letters. [2020-07-29 03:20:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 109 letters. Loop has 41 letters. [2020-07-29 03:20:37,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 109 letters. Loop has 41 letters. [2020-07-29 03:20:37,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 109 letters. Loop has 41 letters. [2020-07-29 03:20:37,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 140 letters. Loop has 43 letters. [2020-07-29 03:20:37,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 140 letters. Loop has 43 letters. [2020-07-29 03:20:37,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 140 letters. Loop has 43 letters. [2020-07-29 03:20:37,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 139 letters. Loop has 41 letters. [2020-07-29 03:20:37,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 139 letters. Loop has 42 letters. [2020-07-29 03:20:37,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 139 letters. Loop has 42 letters. [2020-07-29 03:20:37,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 139 letters. Loop has 42 letters. [2020-07-29 03:20:37,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 71 letters. Loop has 41 letters. [2020-07-29 03:20:37,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 41 letters. [2020-07-29 03:20:37,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 71 letters. Loop has 41 letters. [2020-07-29 03:20:37,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 113 letters. Loop has 41 letters. [2020-07-29 03:20:37,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 113 letters. Loop has 41 letters. [2020-07-29 03:20:37,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 113 letters. Loop has 41 letters. [2020-07-29 03:20:37,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 114 letters. Loop has 41 letters. [2020-07-29 03:20:37,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 119 letters. Loop has 41 letters. [2020-07-29 03:20:37,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 123 letters. Loop has 41 letters. [2020-07-29 03:20:37,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 132 letters. Loop has 43 letters. [2020-07-29 03:20:37,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 132 letters. Loop has 43 letters. [2020-07-29 03:20:37,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 132 letters. Loop has 43 letters. [2020-07-29 03:20:37,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 135 letters. Loop has 42 letters. [2020-07-29 03:20:37,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 135 letters. Loop has 42 letters. [2020-07-29 03:20:37,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 135 letters. Loop has 42 letters. [2020-07-29 03:20:37,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 115 letters. Loop has 41 letters. [2020-07-29 03:20:37,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 124 letters. Loop has 43 letters. [2020-07-29 03:20:37,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 124 letters. Loop has 43 letters. [2020-07-29 03:20:37,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 124 letters. Loop has 43 letters. [2020-07-29 03:20:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 128 letters. Loop has 43 letters. [2020-07-29 03:20:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 128 letters. Loop has 43 letters. [2020-07-29 03:20:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 128 letters. Loop has 43 letters. [2020-07-29 03:20:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 112 letters. Loop has 41 letters. [2020-07-29 03:20:37,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 112 letters. Loop has 41 letters. [2020-07-29 03:20:37,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 112 letters. Loop has 41 letters. [2020-07-29 03:20:37,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 102 letters. Loop has 41 letters. [2020-07-29 03:20:37,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 103 letters. Loop has 41 letters. [2020-07-29 03:20:37,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 110 letters. Loop has 41 letters. [2020-07-29 03:20:37,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 110 letters. Loop has 41 letters. [2020-07-29 03:20:37,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 110 letters. Loop has 41 letters. [2020-07-29 03:20:37,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 111 letters. Loop has 41 letters. [2020-07-29 03:20:37,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 111 letters. Loop has 41 letters. [2020-07-29 03:20:37,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 111 letters. Loop has 41 letters. [2020-07-29 03:20:37,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 138 letters. Loop has 41 letters. [2020-07-29 03:20:37,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 120 letters. Loop has 43 letters. [2020-07-29 03:20:37,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 120 letters. Loop has 43 letters. [2020-07-29 03:20:37,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 120 letters. Loop has 43 letters. [2020-07-29 03:20:37,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 137 letters. Loop has 41 letters. [2020-07-29 03:20:37,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 137 letters. Loop has 41 letters. [2020-07-29 03:20:37,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 137 letters. Loop has 41 letters. [2020-07-29 03:20:37,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 116 letters. Loop has 43 letters. [2020-07-29 03:20:37,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 43 letters. [2020-07-29 03:20:37,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 116 letters. Loop has 43 letters. [2020-07-29 03:20:37,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 101 letters. Loop has 41 letters. [2020-07-29 03:20:37,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 101 letters. Loop has 41 letters. [2020-07-29 03:20:37,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 101 letters. Loop has 41 letters. [2020-07-29 03:20:37,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 100 letters. Loop has 41 letters. [2020-07-29 03:20:37,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 100 letters. Loop has 41 letters. [2020-07-29 03:20:37,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 100 letters. Loop has 41 letters. [2020-07-29 03:20:37,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 99 letters. Loop has 41 letters. [2020-07-29 03:20:37,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 41 letters. [2020-07-29 03:20:37,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 99 letters. Loop has 41 letters. [2020-07-29 03:20:37,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 98 letters. Loop has 41 letters. [2020-07-29 03:20:37,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 98 letters. Loop has 42 letters. [2020-07-29 03:20:37,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 42 letters. [2020-07-29 03:20:37,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 98 letters. Loop has 42 letters. [2020-07-29 03:20:37,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 99 letters. Loop has 43 letters. [2020-07-29 03:20:37,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 43 letters. [2020-07-29 03:20:37,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 99 letters. Loop has 43 letters. [2020-07-29 03:20:37,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 97 letters. Loop has 41 letters. [2020-07-29 03:20:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 96 letters. Loop has 41 letters. [2020-07-29 03:20:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 96 letters. Loop has 41 letters. [2020-07-29 03:20:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 96 letters. Loop has 41 letters. [2020-07-29 03:20:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 95 letters. Loop has 41 letters. [2020-07-29 03:20:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 95 letters. Loop has 41 letters. [2020-07-29 03:20:37,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 95 letters. Loop has 41 letters. [2020-07-29 03:20:37,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 94 letters. Loop has 41 letters. [2020-07-29 03:20:37,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 94 letters. Loop has 42 letters. [2020-07-29 03:20:37,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 42 letters. [2020-07-29 03:20:37,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 94 letters. Loop has 42 letters. [2020-07-29 03:20:37,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 95 letters. Loop has 43 letters. [2020-07-29 03:20:37,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 95 letters. Loop has 43 letters. [2020-07-29 03:20:37,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 95 letters. Loop has 43 letters. [2020-07-29 03:20:37,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 93 letters. Loop has 41 letters. [2020-07-29 03:20:37,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 92 letters. Loop has 41 letters. [2020-07-29 03:20:37,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 92 letters. Loop has 41 letters. [2020-07-29 03:20:37,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 92 letters. Loop has 41 letters. [2020-07-29 03:20:37,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 91 letters. Loop has 41 letters. [2020-07-29 03:20:37,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 41 letters. [2020-07-29 03:20:37,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 91 letters. Loop has 41 letters. [2020-07-29 03:20:37,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 90 letters. Loop has 41 letters. [2020-07-29 03:20:37,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 90 letters. Loop has 42 letters. [2020-07-29 03:20:37,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 42 letters. [2020-07-29 03:20:37,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 90 letters. Loop has 42 letters. [2020-07-29 03:20:37,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 91 letters. Loop has 43 letters. [2020-07-29 03:20:37,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 43 letters. [2020-07-29 03:20:37,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 91 letters. Loop has 43 letters. [2020-07-29 03:20:37,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 89 letters. Loop has 41 letters. [2020-07-29 03:20:37,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 88 letters. Loop has 41 letters. [2020-07-29 03:20:37,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 41 letters. [2020-07-29 03:20:37,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 88 letters. Loop has 41 letters. [2020-07-29 03:20:37,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 87 letters. Loop has 41 letters. [2020-07-29 03:20:37,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 41 letters. [2020-07-29 03:20:37,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 87 letters. Loop has 41 letters. [2020-07-29 03:20:37,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 86 letters. Loop has 41 letters. [2020-07-29 03:20:37,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 86 letters. Loop has 42 letters. [2020-07-29 03:20:37,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 42 letters. [2020-07-29 03:20:37,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 86 letters. Loop has 42 letters. [2020-07-29 03:20:37,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 87 letters. Loop has 43 letters. [2020-07-29 03:20:37,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 43 letters. [2020-07-29 03:20:37,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 87 letters. Loop has 43 letters. [2020-07-29 03:20:37,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 85 letters. Loop has 41 letters. [2020-07-29 03:20:37,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 84 letters. Loop has 41 letters. [2020-07-29 03:20:37,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 41 letters. [2020-07-29 03:20:37,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 84 letters. Loop has 41 letters. [2020-07-29 03:20:37,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 83 letters. Loop has 41 letters. [2020-07-29 03:20:37,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 41 letters. [2020-07-29 03:20:37,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 83 letters. Loop has 41 letters. [2020-07-29 03:20:37,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 82 letters. Loop has 41 letters. [2020-07-29 03:20:37,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 83 letters. Loop has 43 letters. [2020-07-29 03:20:37,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 43 letters. [2020-07-29 03:20:37,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 83 letters. Loop has 43 letters. [2020-07-29 03:20:37,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 82 letters. Loop has 42 letters. [2020-07-29 03:20:37,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 42 letters. [2020-07-29 03:20:37,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 82 letters. Loop has 42 letters. [2020-07-29 03:20:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 81 letters. Loop has 41 letters. [2020-07-29 03:20:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 80 letters. Loop has 41 letters. [2020-07-29 03:20:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 41 letters. [2020-07-29 03:20:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 80 letters. Loop has 41 letters. [2020-07-29 03:20:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 79 letters. Loop has 41 letters. [2020-07-29 03:20:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 41 letters. [2020-07-29 03:20:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 79 letters. Loop has 41 letters. [2020-07-29 03:20:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 78 letters. Loop has 41 letters. [2020-07-29 03:20:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 79 letters. Loop has 43 letters. [2020-07-29 03:20:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 43 letters. [2020-07-29 03:20:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 79 letters. Loop has 43 letters. [2020-07-29 03:20:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 78 letters. Loop has 42 letters. [2020-07-29 03:20:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 42 letters. [2020-07-29 03:20:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 78 letters. Loop has 42 letters. [2020-07-29 03:20:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 77 letters. Loop has 41 letters. [2020-07-29 03:20:37,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 76 letters. Loop has 41 letters. [2020-07-29 03:20:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 41 letters. [2020-07-29 03:20:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 76 letters. Loop has 41 letters. [2020-07-29 03:20:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 75 letters. Loop has 41 letters. [2020-07-29 03:20:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 41 letters. [2020-07-29 03:20:37,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 75 letters. Loop has 41 letters. [2020-07-29 03:20:37,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 74 letters. Loop has 41 letters. [2020-07-29 03:20:37,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 75 letters. Loop has 43 letters. [2020-07-29 03:20:37,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 43 letters. [2020-07-29 03:20:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 75 letters. Loop has 43 letters. [2020-07-29 03:20:37,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 74 letters. Loop has 42 letters. [2020-07-29 03:20:37,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 42 letters. [2020-07-29 03:20:37,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 74 letters. Loop has 42 letters. [2020-07-29 03:20:37,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 73 letters. Loop has 41 letters. [2020-07-29 03:20:37,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 72 letters. Loop has 41 letters. [2020-07-29 03:20:37,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 41 letters. [2020-07-29 03:20:37,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 72 letters. Loop has 41 letters. [2020-07-29 03:20:37,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 70 letters. Loop has 41 letters. [2020-07-29 03:20:37,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 69 letters. Loop has 41 letters. [2020-07-29 03:20:37,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 68 letters. Loop has 41 letters. [2020-07-29 03:20:37,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 41 letters. [2020-07-29 03:20:37,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 68 letters. Loop has 41 letters. [2020-07-29 03:20:37,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 107 letters. Loop has 41 letters. [2020-07-29 03:20:37,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 106 letters. Loop has 41 letters. [2020-07-29 03:20:37,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 105 letters. Loop has 41 letters. [2020-07-29 03:20:37,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 104 letters. Loop has 41 letters. [2020-07-29 03:20:37,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 209 states and 288 transitions. cyclomatic complexity: 80 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 350 states and 509 transitions. cyclomatic complexity: 160 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:37,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,788 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:20:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:20:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-29 03:20:37,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 41 letters. [2020-07-29 03:20:37,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 108 letters. Loop has 41 letters. [2020-07-29 03:20:37,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 67 letters. Loop has 82 letters. [2020-07-29 03:20:37,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:37,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 509 transitions. cyclomatic complexity: 160 [2020-07-29 03:20:37,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:37,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 0 states and 0 transitions. [2020-07-29 03:20:37,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:20:37,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:20:37,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:20:37,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:37,815 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:37,815 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:37,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:20:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:20:37,816 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:20:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:37,816 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:20:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:20:37,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:37,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:37,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:20:37,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:37,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:20:37,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:20:37,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:20:37,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:20:37,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:37,980 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:37,980 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:37,980 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:37,980 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:20:37,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:20:37,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:37,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:37,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:20:37 BoogieIcfgContainer [2020-07-29 03:20:37,988 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:20:37,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:20:37,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:20:37,988 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:20:37,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:23" (3/4) ... [2020-07-29 03:20:37,992 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:20:37,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:20:37,994 INFO L168 Benchmark]: Toolchain (without parser) took 16405.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.7 MB). Free memory was 958.9 MB in the beginning and 1.3 GB in the end (delta: -357.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:37,994 INFO L168 Benchmark]: CDTParser took 0.28 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:20:37,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:37,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.93 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:37,996 INFO L168 Benchmark]: Boogie Preprocessor took 83.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:37,996 INFO L168 Benchmark]: RCFGBuilder took 1213.89 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: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:37,997 INFO L168 Benchmark]: BuchiAutomizer took 14388.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -301.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:20:37,997 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:20:38,000 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.28 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 608.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.93 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1213.89 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: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14388.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -301.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 31 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 14.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 10.1s. Construction of modules took 0.1s. Büchi inclusion checks took 3.5s. 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 209 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 895 SDtfs, 291 SDslu, 1519 SDs, 0 SdLazy, 36 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax141 hnf109 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq230 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...