/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:49:03,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:49:03,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:49:03,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:49:03,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:49:03,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:49:03,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:49:03,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:49:03,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:49:03,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:49:03,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:49:03,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:49:03,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:49:03,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:49:03,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:49:03,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:49:03,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:49:03,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:49:03,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:49:03,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:49:03,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:49:03,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:49:03,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:49:03,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:49:03,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:49:03,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:49:03,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:49:03,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:49:03,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:49:03,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:49:03,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:49:03,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:49:03,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:49:03,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:49:03,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:49:03,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:49:03,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:49:03,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:49:03,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:49:03,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:49:03,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:49:03,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:49:03,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:49:03,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:49:03,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:49:03,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:49:03,741 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:49:03,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:49:03,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:49:03,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:49:03,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:49:03,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:49:03,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:49:03,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:49:03,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:49:03,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:49:03,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:49:03,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:49:03,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:49:03,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:49:03,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:49:03,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:49:03,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:49:03,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:49:03,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:49:03,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:49:03,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:49:03,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:49:03,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:49:03,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:49:03,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:49:03,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:49:04,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:49:04,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:49:04,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:49:04,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:49:04,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:49:04,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-11-23 22:49:04,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe905fd1/003f68c865a24819bfba3546f5f5c783/FLAG96fe53e04 [2019-11-23 22:49:04,629 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:49:04,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-11-23 22:49:04,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe905fd1/003f68c865a24819bfba3546f5f5c783/FLAG96fe53e04 [2019-11-23 22:49:05,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe905fd1/003f68c865a24819bfba3546f5f5c783 [2019-11-23 22:49:05,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:49:05,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:49:05,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:05,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:49:05,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:49:05,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262ce2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05, skipping insertion in model container [2019-11-23 22:49:05,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:49:05,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:49:05,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:05,325 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:49:05,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:05,491 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:49:05,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05 WrapperNode [2019-11-23 22:49:05,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:05,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:05,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:49:05,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:49:05,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:05,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:49:05,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:49:05,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:49:05,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (1/1) ... [2019-11-23 22:49:05,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:49:05,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:49:05,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:49:05,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:49:05,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:49:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:49:05,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:49:06,525 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:49:06,525 INFO L284 CfgBuilder]: Removed 103 assume(true) statements. [2019-11-23 22:49:06,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:06 BoogieIcfgContainer [2019-11-23 22:49:06,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:49:06,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:49:06,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:49:06,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:49:06,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:05" (1/3) ... [2019-11-23 22:49:06,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb75af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:06, skipping insertion in model container [2019-11-23 22:49:06,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:05" (2/3) ... [2019-11-23 22:49:06,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acb75af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:06, skipping insertion in model container [2019-11-23 22:49:06,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:06" (3/3) ... [2019-11-23 22:49:06,535 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-11-23 22:49:06,545 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:49:06,553 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:49:06,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:49:06,592 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:49:06,592 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:49:06,592 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:49:06,592 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:49:06,593 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:49:06,593 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:49:06,593 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:49:06,593 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:49:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2019-11-23 22:49:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:06,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:06,625 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:06,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-23 22:49:06,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:06,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322076264] [2019-11-23 22:49:06,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:06,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322076264] [2019-11-23 22:49:06,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:06,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:06,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36399407] [2019-11-23 22:49:06,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:06,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:06,818 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 3 states. [2019-11-23 22:49:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:06,890 INFO L93 Difference]: Finished difference Result 431 states and 673 transitions. [2019-11-23 22:49:06,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:06,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:06,910 INFO L225 Difference]: With dead ends: 431 [2019-11-23 22:49:06,910 INFO L226 Difference]: Without dead ends: 214 [2019-11-23 22:49:06,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-23 22:49:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-11-23 22:49:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-23 22:49:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 324 transitions. [2019-11-23 22:49:06,979 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 324 transitions. Word has length 50 [2019-11-23 22:49:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:06,979 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 324 transitions. [2019-11-23 22:49:06,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 324 transitions. [2019-11-23 22:49:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:06,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:06,982 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:06,983 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-23 22:49:06,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:06,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103357072] [2019-11-23 22:49:06,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103357072] [2019-11-23 22:49:07,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754436241] [2019-11-23 22:49:07,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,064 INFO L87 Difference]: Start difference. First operand 214 states and 324 transitions. Second operand 3 states. [2019-11-23 22:49:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,154 INFO L93 Difference]: Finished difference Result 574 states and 868 transitions. [2019-11-23 22:49:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,158 INFO L225 Difference]: With dead ends: 574 [2019-11-23 22:49:07,158 INFO L226 Difference]: Without dead ends: 367 [2019-11-23 22:49:07,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-11-23 22:49:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2019-11-23 22:49:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 549 transitions. [2019-11-23 22:49:07,215 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 549 transitions. Word has length 50 [2019-11-23 22:49:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,215 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 549 transitions. [2019-11-23 22:49:07,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 549 transitions. [2019-11-23 22:49:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,218 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-23 22:49:07,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86389312] [2019-11-23 22:49:07,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86389312] [2019-11-23 22:49:07,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323544056] [2019-11-23 22:49:07,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,287 INFO L87 Difference]: Start difference. First operand 365 states and 549 transitions. Second operand 3 states. [2019-11-23 22:49:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,332 INFO L93 Difference]: Finished difference Result 722 states and 1087 transitions. [2019-11-23 22:49:07,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,336 INFO L225 Difference]: With dead ends: 722 [2019-11-23 22:49:07,336 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:49:07,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:49:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-23 22:49:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 541 transitions. [2019-11-23 22:49:07,375 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 541 transitions. Word has length 50 [2019-11-23 22:49:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,376 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 541 transitions. [2019-11-23 22:49:07,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 541 transitions. [2019-11-23 22:49:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,378 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,378 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-23 22:49:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674122512] [2019-11-23 22:49:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674122512] [2019-11-23 22:49:07,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237768397] [2019-11-23 22:49:07,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,423 INFO L87 Difference]: Start difference. First operand 365 states and 541 transitions. Second operand 3 states. [2019-11-23 22:49:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,457 INFO L93 Difference]: Finished difference Result 721 states and 1070 transitions. [2019-11-23 22:49:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,460 INFO L225 Difference]: With dead ends: 721 [2019-11-23 22:49:07,461 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:49:07,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:49:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-23 22:49:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 533 transitions. [2019-11-23 22:49:07,481 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 533 transitions. Word has length 50 [2019-11-23 22:49:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,481 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 533 transitions. [2019-11-23 22:49:07,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 533 transitions. [2019-11-23 22:49:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,483 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,483 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-23 22:49:07,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015800149] [2019-11-23 22:49:07,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015800149] [2019-11-23 22:49:07,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932763735] [2019-11-23 22:49:07,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,548 INFO L87 Difference]: Start difference. First operand 365 states and 533 transitions. Second operand 3 states. [2019-11-23 22:49:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,613 INFO L93 Difference]: Finished difference Result 720 states and 1053 transitions. [2019-11-23 22:49:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,615 INFO L225 Difference]: With dead ends: 720 [2019-11-23 22:49:07,616 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:49:07,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:49:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-23 22:49:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 517 transitions. [2019-11-23 22:49:07,635 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 517 transitions. Word has length 50 [2019-11-23 22:49:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,635 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 517 transitions. [2019-11-23 22:49:07,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 517 transitions. [2019-11-23 22:49:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,637 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,637 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-23 22:49:07,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523157954] [2019-11-23 22:49:07,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523157954] [2019-11-23 22:49:07,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176647149] [2019-11-23 22:49:07,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,681 INFO L87 Difference]: Start difference. First operand 365 states and 517 transitions. Second operand 3 states. [2019-11-23 22:49:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,740 INFO L93 Difference]: Finished difference Result 719 states and 1020 transitions. [2019-11-23 22:49:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,743 INFO L225 Difference]: With dead ends: 719 [2019-11-23 22:49:07,743 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:49:07,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:49:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-23 22:49:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 501 transitions. [2019-11-23 22:49:07,768 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 501 transitions. Word has length 50 [2019-11-23 22:49:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,768 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 501 transitions. [2019-11-23 22:49:07,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 501 transitions. [2019-11-23 22:49:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,770 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-23 22:49:07,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235491377] [2019-11-23 22:49:07,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235491377] [2019-11-23 22:49:07,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785298724] [2019-11-23 22:49:07,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,814 INFO L87 Difference]: Start difference. First operand 365 states and 501 transitions. Second operand 3 states. [2019-11-23 22:49:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:07,882 INFO L93 Difference]: Finished difference Result 718 states and 987 transitions. [2019-11-23 22:49:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:07,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:07,885 INFO L225 Difference]: With dead ends: 718 [2019-11-23 22:49:07,885 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:49:07,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:49:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-23 22:49:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-23 22:49:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 485 transitions. [2019-11-23 22:49:07,935 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 485 transitions. Word has length 50 [2019-11-23 22:49:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:07,935 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 485 transitions. [2019-11-23 22:49:07,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 485 transitions. [2019-11-23 22:49:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:49:07,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:07,937 INFO L410 BasicCegarLoop]: trace 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] [2019-11-23 22:49:07,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-23 22:49:07,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:07,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295189203] [2019-11-23 22:49:07,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:07,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295189203] [2019-11-23 22:49:07,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:07,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:07,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156743436] [2019-11-23 22:49:07,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:07,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:07,994 INFO L87 Difference]: Start difference. First operand 365 states and 485 transitions. Second operand 3 states. [2019-11-23 22:49:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:08,073 INFO L93 Difference]: Finished difference Result 1026 states and 1370 transitions. [2019-11-23 22:49:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:08,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:49:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:08,078 INFO L225 Difference]: With dead ends: 1026 [2019-11-23 22:49:08,078 INFO L226 Difference]: Without dead ends: 675 [2019-11-23 22:49:08,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-23 22:49:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 637. [2019-11-23 22:49:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-11-23 22:49:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 840 transitions. [2019-11-23 22:49:08,110 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 840 transitions. Word has length 50 [2019-11-23 22:49:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:08,112 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 840 transitions. [2019-11-23 22:49:08,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 840 transitions. [2019-11-23 22:49:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:49:08,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:08,115 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:08,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1243301229, now seen corresponding path program 1 times [2019-11-23 22:49:08,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:08,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627301216] [2019-11-23 22:49:08,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:08,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627301216] [2019-11-23 22:49:08,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:08,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:08,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141331332] [2019-11-23 22:49:08,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:08,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:08,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:08,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,218 INFO L87 Difference]: Start difference. First operand 637 states and 840 transitions. Second operand 3 states. [2019-11-23 22:49:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:08,321 INFO L93 Difference]: Finished difference Result 1757 states and 2314 transitions. [2019-11-23 22:49:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:08,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-23 22:49:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:08,328 INFO L225 Difference]: With dead ends: 1757 [2019-11-23 22:49:08,328 INFO L226 Difference]: Without dead ends: 1158 [2019-11-23 22:49:08,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-23 22:49:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1116. [2019-11-23 22:49:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-11-23 22:49:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1450 transitions. [2019-11-23 22:49:08,393 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1450 transitions. Word has length 81 [2019-11-23 22:49:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:08,394 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 1450 transitions. [2019-11-23 22:49:08,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1450 transitions. [2019-11-23 22:49:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:49:08,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:08,396 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:08,396 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1431220057, now seen corresponding path program 1 times [2019-11-23 22:49:08,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:08,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499219] [2019-11-23 22:49:08,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:08,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499219] [2019-11-23 22:49:08,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:08,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:08,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319972543] [2019-11-23 22:49:08,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:08,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,461 INFO L87 Difference]: Start difference. First operand 1116 states and 1450 transitions. Second operand 3 states. [2019-11-23 22:49:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:08,611 INFO L93 Difference]: Finished difference Result 3116 states and 4037 transitions. [2019-11-23 22:49:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:08,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:49:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:08,621 INFO L225 Difference]: With dead ends: 3116 [2019-11-23 22:49:08,622 INFO L226 Difference]: Without dead ends: 2038 [2019-11-23 22:49:08,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-11-23 22:49:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2012. [2019-11-23 22:49:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-11-23 22:49:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2587 transitions. [2019-11-23 22:49:08,722 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2587 transitions. Word has length 82 [2019-11-23 22:49:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:08,723 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 2587 transitions. [2019-11-23 22:49:08,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2587 transitions. [2019-11-23 22:49:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:49:08,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:08,725 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:08,726 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash -130062243, now seen corresponding path program 1 times [2019-11-23 22:49:08,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:08,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455014785] [2019-11-23 22:49:08,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:08,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455014785] [2019-11-23 22:49:08,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:08,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:08,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196908220] [2019-11-23 22:49:08,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:08,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,762 INFO L87 Difference]: Start difference. First operand 2012 states and 2587 transitions. Second operand 3 states. [2019-11-23 22:49:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:08,861 INFO L93 Difference]: Finished difference Result 3960 states and 5098 transitions. [2019-11-23 22:49:08,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:08,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:49:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:08,871 INFO L225 Difference]: With dead ends: 3960 [2019-11-23 22:49:08,871 INFO L226 Difference]: Without dead ends: 1980 [2019-11-23 22:49:08,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2019-11-23 22:49:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1980. [2019-11-23 22:49:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1980 states. [2019-11-23 22:49:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 2549 transitions. [2019-11-23 22:49:08,995 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 2549 transitions. Word has length 82 [2019-11-23 22:49:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:08,995 INFO L462 AbstractCegarLoop]: Abstraction has 1980 states and 2549 transitions. [2019-11-23 22:49:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2549 transitions. [2019-11-23 22:49:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:49:08,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:08,998 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:08,998 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1189736877, now seen corresponding path program 1 times [2019-11-23 22:49:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:08,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153053239] [2019-11-23 22:49:08,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:09,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153053239] [2019-11-23 22:49:09,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:09,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:09,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673316603] [2019-11-23 22:49:09,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:09,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:09,041 INFO L87 Difference]: Start difference. First operand 1980 states and 2549 transitions. Second operand 3 states. [2019-11-23 22:49:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:09,241 INFO L93 Difference]: Finished difference Result 5640 states and 7245 transitions. [2019-11-23 22:49:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:09,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:49:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:09,259 INFO L225 Difference]: With dead ends: 5640 [2019-11-23 22:49:09,260 INFO L226 Difference]: Without dead ends: 3698 [2019-11-23 22:49:09,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-11-23 22:49:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2019-11-23 22:49:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2019-11-23 22:49:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4676 transitions. [2019-11-23 22:49:09,516 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4676 transitions. Word has length 83 [2019-11-23 22:49:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:09,517 INFO L462 AbstractCegarLoop]: Abstraction has 3698 states and 4676 transitions. [2019-11-23 22:49:09,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4676 transitions. [2019-11-23 22:49:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:49:09,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:09,523 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:09,524 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1542521505, now seen corresponding path program 1 times [2019-11-23 22:49:09,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:09,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507318822] [2019-11-23 22:49:09,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:09,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507318822] [2019-11-23 22:49:09,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:09,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:09,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90240239] [2019-11-23 22:49:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:09,587 INFO L87 Difference]: Start difference. First operand 3698 states and 4676 transitions. Second operand 3 states. [2019-11-23 22:49:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:09,836 INFO L93 Difference]: Finished difference Result 8964 states and 11306 transitions. [2019-11-23 22:49:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:09,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:49:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:09,861 INFO L225 Difference]: With dead ends: 8964 [2019-11-23 22:49:09,861 INFO L226 Difference]: Without dead ends: 5302 [2019-11-23 22:49:09,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2019-11-23 22:49:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 5268. [2019-11-23 22:49:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-11-23 22:49:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 6584 transitions. [2019-11-23 22:49:10,134 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 6584 transitions. Word has length 106 [2019-11-23 22:49:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:10,134 INFO L462 AbstractCegarLoop]: Abstraction has 5268 states and 6584 transitions. [2019-11-23 22:49:10,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 6584 transitions. [2019-11-23 22:49:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:49:10,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:10,141 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:10,141 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1319942113, now seen corresponding path program 1 times [2019-11-23 22:49:10,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:10,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507237303] [2019-11-23 22:49:10,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:10,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507237303] [2019-11-23 22:49:10,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:10,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:10,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942424665] [2019-11-23 22:49:10,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:10,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:10,190 INFO L87 Difference]: Start difference. First operand 5268 states and 6584 transitions. Second operand 3 states. [2019-11-23 22:49:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:10,689 INFO L93 Difference]: Finished difference Result 12818 states and 16008 transitions. [2019-11-23 22:49:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:10,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:49:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:10,738 INFO L225 Difference]: With dead ends: 12818 [2019-11-23 22:49:10,739 INFO L226 Difference]: Without dead ends: 7598 [2019-11-23 22:49:10,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2019-11-23 22:49:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7548. [2019-11-23 22:49:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7548 states. [2019-11-23 22:49:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7548 states to 7548 states and 9354 transitions. [2019-11-23 22:49:11,152 INFO L78 Accepts]: Start accepts. Automaton has 7548 states and 9354 transitions. Word has length 106 [2019-11-23 22:49:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:11,153 INFO L462 AbstractCegarLoop]: Abstraction has 7548 states and 9354 transitions. [2019-11-23 22:49:11,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7548 states and 9354 transitions. [2019-11-23 22:49:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:49:11,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:11,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:11,162 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1767995646, now seen corresponding path program 1 times [2019-11-23 22:49:11,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:11,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969715233] [2019-11-23 22:49:11,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:49:11,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969715233] [2019-11-23 22:49:11,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:11,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:11,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199129101] [2019-11-23 22:49:11,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:11,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:11,210 INFO L87 Difference]: Start difference. First operand 7548 states and 9354 transitions. Second operand 3 states. [2019-11-23 22:49:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:11,595 INFO L93 Difference]: Finished difference Result 13433 states and 16720 transitions. [2019-11-23 22:49:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:11,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 22:49:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:11,630 INFO L225 Difference]: With dead ends: 13433 [2019-11-23 22:49:11,630 INFO L226 Difference]: Without dead ends: 7662 [2019-11-23 22:49:11,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-23 22:49:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7404. [2019-11-23 22:49:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7404 states. [2019-11-23 22:49:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 9018 transitions. [2019-11-23 22:49:11,986 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 9018 transitions. Word has length 120 [2019-11-23 22:49:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:11,986 INFO L462 AbstractCegarLoop]: Abstraction has 7404 states and 9018 transitions. [2019-11-23 22:49:11,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 9018 transitions. [2019-11-23 22:49:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:49:12,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:12,000 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:12,058 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 400305973, now seen corresponding path program 1 times [2019-11-23 22:49:12,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:12,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445013300] [2019-11-23 22:49:12,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:12,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445013300] [2019-11-23 22:49:12,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:12,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:12,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550953101] [2019-11-23 22:49:12,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:12,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:12,135 INFO L87 Difference]: Start difference. First operand 7404 states and 9018 transitions. Second operand 5 states. [2019-11-23 22:49:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:12,579 INFO L93 Difference]: Finished difference Result 13859 states and 16979 transitions. [2019-11-23 22:49:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:12,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 22:49:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:12,595 INFO L225 Difference]: With dead ends: 13859 [2019-11-23 22:49:12,595 INFO L226 Difference]: Without dead ends: 6473 [2019-11-23 22:49:12,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2019-11-23 22:49:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 5145. [2019-11-23 22:49:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5145 states. [2019-11-23 22:49:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 6175 transitions. [2019-11-23 22:49:12,941 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 6175 transitions. Word has length 121 [2019-11-23 22:49:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:12,941 INFO L462 AbstractCegarLoop]: Abstraction has 5145 states and 6175 transitions. [2019-11-23 22:49:12,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 6175 transitions. [2019-11-23 22:49:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:49:12,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:12,947 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:12,947 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash -336248298, now seen corresponding path program 1 times [2019-11-23 22:49:12,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:12,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310852986] [2019-11-23 22:49:12,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:13,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310852986] [2019-11-23 22:49:13,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:13,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:13,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612616488] [2019-11-23 22:49:13,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:13,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:13,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:13,014 INFO L87 Difference]: Start difference. First operand 5145 states and 6175 transitions. Second operand 5 states. [2019-11-23 22:49:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:13,367 INFO L93 Difference]: Finished difference Result 11214 states and 13485 transitions. [2019-11-23 22:49:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:13,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 22:49:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:13,379 INFO L225 Difference]: With dead ends: 11214 [2019-11-23 22:49:13,379 INFO L226 Difference]: Without dead ends: 6093 [2019-11-23 22:49:13,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2019-11-23 22:49:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 5181. [2019-11-23 22:49:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5181 states. [2019-11-23 22:49:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 6098 transitions. [2019-11-23 22:49:13,659 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 6098 transitions. Word has length 121 [2019-11-23 22:49:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:13,660 INFO L462 AbstractCegarLoop]: Abstraction has 5181 states and 6098 transitions. [2019-11-23 22:49:13,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 6098 transitions. [2019-11-23 22:49:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:49:13,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:13,666 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:13,667 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1918082068, now seen corresponding path program 1 times [2019-11-23 22:49:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:13,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187271030] [2019-11-23 22:49:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:13,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187271030] [2019-11-23 22:49:13,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:13,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:13,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068071386] [2019-11-23 22:49:13,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:13,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:13,816 INFO L87 Difference]: Start difference. First operand 5181 states and 6098 transitions. Second operand 3 states. [2019-11-23 22:49:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:14,059 INFO L93 Difference]: Finished difference Result 9177 states and 10845 transitions. [2019-11-23 22:49:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:14,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:49:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:14,069 INFO L225 Difference]: With dead ends: 9177 [2019-11-23 22:49:14,070 INFO L226 Difference]: Without dead ends: 5205 [2019-11-23 22:49:14,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-11-23 22:49:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5181. [2019-11-23 22:49:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5181 states. [2019-11-23 22:49:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 5966 transitions. [2019-11-23 22:49:14,305 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 5966 transitions. Word has length 121 [2019-11-23 22:49:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:14,306 INFO L462 AbstractCegarLoop]: Abstraction has 5181 states and 5966 transitions. [2019-11-23 22:49:14,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 5966 transitions. [2019-11-23 22:49:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:49:14,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:14,311 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:14,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2051522169, now seen corresponding path program 1 times [2019-11-23 22:49:14,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:14,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817578940] [2019-11-23 22:49:14,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:14,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817578940] [2019-11-23 22:49:14,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:14,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:14,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890396674] [2019-11-23 22:49:14,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:14,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:14,352 INFO L87 Difference]: Start difference. First operand 5181 states and 5966 transitions. Second operand 3 states. [2019-11-23 22:49:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:14,658 INFO L93 Difference]: Finished difference Result 9155 states and 10558 transitions. [2019-11-23 22:49:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:14,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-23 22:49:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:14,667 INFO L225 Difference]: With dead ends: 9155 [2019-11-23 22:49:14,667 INFO L226 Difference]: Without dead ends: 5183 [2019-11-23 22:49:14,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2019-11-23 22:49:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5181. [2019-11-23 22:49:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5181 states. [2019-11-23 22:49:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 5942 transitions. [2019-11-23 22:49:14,907 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 5942 transitions. Word has length 122 [2019-11-23 22:49:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:14,907 INFO L462 AbstractCegarLoop]: Abstraction has 5181 states and 5942 transitions. [2019-11-23 22:49:14,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 5942 transitions. [2019-11-23 22:49:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-23 22:49:14,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:14,913 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:14,913 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2042317309, now seen corresponding path program 1 times [2019-11-23 22:49:14,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:14,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680388786] [2019-11-23 22:49:14,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:14,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680388786] [2019-11-23 22:49:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:15,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181272027] [2019-11-23 22:49:15,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:15,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:15,001 INFO L87 Difference]: Start difference. First operand 5181 states and 5942 transitions. Second operand 5 states. [2019-11-23 22:49:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:15,463 INFO L93 Difference]: Finished difference Result 11361 states and 13123 transitions. [2019-11-23 22:49:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:15,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-11-23 22:49:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:15,475 INFO L225 Difference]: With dead ends: 11361 [2019-11-23 22:49:15,475 INFO L226 Difference]: Without dead ends: 6210 [2019-11-23 22:49:15,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6210 states. [2019-11-23 22:49:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6210 to 4374. [2019-11-23 22:49:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-11-23 22:49:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 4929 transitions. [2019-11-23 22:49:15,832 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 4929 transitions. Word has length 123 [2019-11-23 22:49:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:15,833 INFO L462 AbstractCegarLoop]: Abstraction has 4374 states and 4929 transitions. [2019-11-23 22:49:15,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 4929 transitions. [2019-11-23 22:49:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:15,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:15,839 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:15,839 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 454002597, now seen corresponding path program 1 times [2019-11-23 22:49:15,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:15,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466869536] [2019-11-23 22:49:15,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:49:15,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466869536] [2019-11-23 22:49:15,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:15,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:15,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500555213] [2019-11-23 22:49:15,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:15,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:15,888 INFO L87 Difference]: Start difference. First operand 4374 states and 4929 transitions. Second operand 3 states. [2019-11-23 22:49:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:16,036 INFO L93 Difference]: Finished difference Result 6001 states and 6767 transitions. [2019-11-23 22:49:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:16,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:16,039 INFO L225 Difference]: With dead ends: 6001 [2019-11-23 22:49:16,039 INFO L226 Difference]: Without dead ends: 1491 [2019-11-23 22:49:16,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-11-23 22:49:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2019-11-23 22:49:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-23 22:49:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1626 transitions. [2019-11-23 22:49:16,119 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1626 transitions. Word has length 148 [2019-11-23 22:49:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,119 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 1626 transitions. [2019-11-23 22:49:16,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1626 transitions. [2019-11-23 22:49:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:49:16,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,122 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:16,122 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1356184508, now seen corresponding path program 1 times [2019-11-23 22:49:16,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383115351] [2019-11-23 22:49:16,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:16,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383115351] [2019-11-23 22:49:16,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:16,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180734379] [2019-11-23 22:49:16,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:16,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,175 INFO L87 Difference]: Start difference. First operand 1491 states and 1626 transitions. Second operand 3 states. [2019-11-23 22:49:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:16,290 INFO L93 Difference]: Finished difference Result 2322 states and 2538 transitions. [2019-11-23 22:49:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:16,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:49:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:16,295 INFO L225 Difference]: With dead ends: 2322 [2019-11-23 22:49:16,295 INFO L226 Difference]: Without dead ends: 1527 [2019-11-23 22:49:16,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-11-23 22:49:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1491. [2019-11-23 22:49:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-23 22:49:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1606 transitions. [2019-11-23 22:49:16,368 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1606 transitions. Word has length 149 [2019-11-23 22:49:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,369 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 1606 transitions. [2019-11-23 22:49:16,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1606 transitions. [2019-11-23 22:49:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:49:16,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,372 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:16,372 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash -443547140, now seen corresponding path program 1 times [2019-11-23 22:49:16,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543124068] [2019-11-23 22:49:16,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:16,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543124068] [2019-11-23 22:49:16,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:16,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556197226] [2019-11-23 22:49:16,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:16,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,423 INFO L87 Difference]: Start difference. First operand 1491 states and 1606 transitions. Second operand 3 states. [2019-11-23 22:49:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:16,501 INFO L93 Difference]: Finished difference Result 2633 states and 2839 transitions. [2019-11-23 22:49:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:16,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:49:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:16,504 INFO L225 Difference]: With dead ends: 2633 [2019-11-23 22:49:16,504 INFO L226 Difference]: Without dead ends: 1491 [2019-11-23 22:49:16,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-11-23 22:49:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2019-11-23 22:49:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-23 22:49:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1584 transitions. [2019-11-23 22:49:16,583 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1584 transitions. Word has length 150 [2019-11-23 22:49:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,584 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 1584 transitions. [2019-11-23 22:49:16,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1584 transitions. [2019-11-23 22:49:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:49:16,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,586 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:16,587 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 362557874, now seen corresponding path program 1 times [2019-11-23 22:49:16,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541168431] [2019-11-23 22:49:16,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:16,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541168431] [2019-11-23 22:49:16,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:16,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871279250] [2019-11-23 22:49:16,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:16,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:16,740 INFO L87 Difference]: Start difference. First operand 1491 states and 1584 transitions. Second operand 5 states. [2019-11-23 22:49:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:16,855 INFO L93 Difference]: Finished difference Result 1491 states and 1584 transitions. [2019-11-23 22:49:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:49:16,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-23 22:49:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:16,857 INFO L225 Difference]: With dead ends: 1491 [2019-11-23 22:49:16,857 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:49:16,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:49:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:49:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:49:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:49:16,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2019-11-23 22:49:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,860 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:49:16,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:49:16,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:49:16,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:49:17,413 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 123 [2019-11-23 22:49:17,518 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-11-23 22:49:17,633 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 88 [2019-11-23 22:49:18,156 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 127 [2019-11-23 22:49:18,420 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:18,661 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 103 [2019-11-23 22:49:18,884 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:19,515 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:20,217 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:20,508 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:20,752 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:20,964 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:21,240 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 106 [2019-11-23 22:49:21,702 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-23 22:49:21,896 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-11-23 22:49:22,031 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-23 22:49:22,232 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-23 22:49:22,387 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-23 22:49:22,599 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-23 22:49:23,376 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-23 22:49:24,173 WARN L192 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-11-23 22:49:24,866 WARN L192 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-23 22:49:25,527 WARN L192 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-23 22:49:26,371 WARN L192 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:27,111 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-23 22:49:27,812 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-23 22:49:28,121 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-23 22:49:28,332 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-23 22:49:29,272 WARN L192 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2019-11-23 22:49:29,385 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-23 22:49:30,064 WARN L192 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-23 22:49:31,527 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:32,023 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-23 22:49:33,227 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-11-23 22:49:34,643 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:35,165 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-11-23 22:49:35,272 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-23 22:49:36,107 WARN L192 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-23 22:49:36,223 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-23 22:49:36,389 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-23 22:49:37,105 WARN L192 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-23 22:49:37,688 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-23 22:49:38,420 WARN L192 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-23 22:49:38,616 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-23 22:49:38,880 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-23 22:49:39,099 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-23 22:49:39,219 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-23 22:49:40,655 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:41,497 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:42,246 WARN L192 SmtUtils]: Spent 747.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-23 22:49:43,092 WARN L192 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:43,938 WARN L192 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:44,067 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-23 22:49:44,245 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-23 22:49:44,825 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-11-23 22:49:45,654 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:45,778 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-23 22:49:46,650 WARN L192 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:48,079 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:48,398 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-23 22:49:48,597 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-23 22:49:49,442 WARN L192 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:50,895 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:51,272 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-23 22:49:52,108 WARN L192 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:53,611 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:54,449 WARN L192 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:55,860 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:56,698 WARN L192 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:58,117 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-23 22:49:58,325 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-23 22:49:59,163 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:49:59,794 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-23 22:50:00,908 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-11-23 22:50:01,084 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-11-23 22:50:01,931 WARN L192 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-23 22:50:01,940 INFO L440 ceAbstractionStarter]: At program point L431-14(lines 372 376) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,940 INFO L444 ceAbstractionStarter]: For program point L431-15(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,940 INFO L440 ceAbstractionStarter]: At program point L431-17(lines 464 468) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,941 INFO L440 ceAbstractionStarter]: At program point L168(lines 152 170) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse2 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (= 0 ~t2_pc~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (<= 2 ~M_E~0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= ~local~0 ~token~0) (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-23 22:50:01,941 INFO L440 ceAbstractionStarter]: At program point L168-1(lines 152 170) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse13 (= ~token~0 ~local~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse21 (= 0 ~t1_pc~0)) (.cse15 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~T2_E~0)) (.cse22 (= 0 ~t1_st~0)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse7 (<= 2 ~E_M~0)) (.cse19 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse20 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse9 (<= 2 ~E_2~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse5 .cse4 .cse16 .cse17 .cse18 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse21 .cse15 .cse3 .cse4 .cse22 .cse18 .cse7 .cse6 .cse19 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse21 .cse15 .cse3 .cse4 .cse22 .cse16 .cse17 .cse18 .cse7 .cse19 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14))) [2019-11-23 22:50:01,942 INFO L440 ceAbstractionStarter]: At program point L168-2(lines 152 170) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse6 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~T2_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse1 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse1) (= 1 ~t2_pc~0) .cse2 .cse3 .cse4 (<= 2 ~t2_st~0) .cse5 .cse6 (<= .cse1 ~token~0) .cse7 .cse8 .cse9)) (and .cse0 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse3 .cse4 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse5 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse6 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse6 (= ~m_pc~0 0) .cse2 .cse3 .cse4 .cse7 .cse8 .cse9))) [2019-11-23 22:50:01,942 INFO L440 ceAbstractionStarter]: At program point L168-3(lines 152 170) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (= 1 ~t2_pc~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse10 (<= 2 ~t1_st~0)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse9 .cse3 .cse4 .cse5 .cse10 .cse1 .cse2 .cse6 (<= .cse11 ~token~0) .cse7 (<= ~token~0 .cse11))) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:50:01,942 INFO L440 ceAbstractionStarter]: At program point L168-4(lines 152 170) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse16 (= ~m_st~0 0)) (.cse28 (= 0 ~t1_pc~0)) (.cse21 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse17 (= ~m_pc~0 0)) (.cse7 (= 0 ~t1_st~0)) (.cse22 (= 0 ~t2_pc~0)) (.cse23 (= 0 ~t2_st~0)) (.cse24 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse25 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse26 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse20 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (= ~token~0 ~local~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse3 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse18 (<= 2 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse20 .cse13 .cse15 .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse24 .cse9 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse1 .cse2 .cse16 .cse21 .cse17 .cse5 .cse6 .cse18 .cse22 .cse23 .cse24 .cse9 .cse25 .cse10 .cse26 .cse11 .cse19 .cse12 .cse20 .cse13 .cse15 .cse14) (and .cse1 .cse21 .cse4 .cse5 .cse6 .cse18 .cse22 .cse23 .cse24 .cse9 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14) (let ((.cse27 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse27) .cse3 .cse4 .cse5 .cse6 .cse18 .cse23 .cse9 .cse10 .cse11 (<= .cse27 ~token~0) .cse12 .cse13 .cse14)) (and .cse9 .cse1 .cse10 .cse11 .cse17 .cse4 .cse5 .cse6 .cse12 .cse13 .cse14) (and .cse1 .cse28 .cse21 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse24 .cse9 .cse25 .cse10 .cse26 .cse11 .cse19 .cse12 .cse20 .cse13 .cse14) (and .cse1 .cse3 .cse16 .cse28 .cse21 .cse17 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse26 .cse11 .cse19 .cse12 .cse20 .cse13 .cse15 .cse14) (let ((.cse29 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse20 (<= .cse29 ~token~0) .cse13 .cse14 (<= ~token~0 .cse29))) (and .cse1 .cse3 .cse28 .cse21 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse26 .cse11 .cse19 .cse12 .cse20 .cse13 .cse14) (and .cse1 .cse16 .cse28 .cse21 .cse17 .cse5 .cse6 .cse7 .cse22 .cse23 .cse24 .cse9 .cse25 .cse10 .cse26 .cse11 .cse19 .cse12 .cse20 .cse13 .cse15 .cse14) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-23 22:50:01,943 INFO L440 ceAbstractionStarter]: At program point L168-5(lines 152 170) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t2_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse22 (= ~m_st~0 0)) (.cse29 (= 0 ~t1_pc~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse28 (= ~m_pc~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (<= 2 ~T2_E~0)) (.cse25 (= 0 ~t1_st~0)) (.cse27 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse20 (<= 2 ~E_1~0)) (.cse26 (= ~token~0 ~local~0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse3 ~token~0) .cse17 .cse18 .cse19 .cse20 .cse21)) (let ((.cse24 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse22 .cse5 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= .cse24 ~token~0) .cse20 .cse21 (<= ~token~0 .cse24))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse25 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse2 .cse22 .cse5 .cse28 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse12 .cse1 .cse14 .cse16 .cse28 .cse6 .cse7 .cse8 .cse18 .cse20 .cse21) (and .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse29 .cse5 .cse6 .cse7 .cse8 .cse25 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse4 .cse22 .cse29 .cse5 .cse28 .cse7 .cse8 .cse25 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse2 .cse4 .cse22 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse25 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse29 .cse5 .cse28 .cse7 .cse8 .cse25 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21))) [2019-11-23 22:50:01,943 INFO L444 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,943 INFO L444 ceAbstractionStarter]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2019-11-23 22:50:01,943 INFO L444 ceAbstractionStarter]: For program point L334-4(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,943 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2019-11-23 22:50:01,944 INFO L440 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~M_E~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (= ~local~0 ~token~0) (= ~m_st~0 0) .cse1 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 .cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:50:01,944 INFO L440 ceAbstractionStarter]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= 0 ~t2_st~0)) (.cse20 (= 0 ~t1_pc~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse22 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse15 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse2 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse17 .cse18 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse22 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19))) [2019-11-23 22:50:01,944 INFO L440 ceAbstractionStarter]: At program point L205-2(lines 193 207) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse15 (= 1 ~t2_pc~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~t2_st~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse7 .cse8 (= ~m_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse11 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse17 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse17) .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 (<= .cse17 ~token~0) .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-11-23 22:50:01,945 INFO L440 ceAbstractionStarter]: At program point L205-3(lines 193 207) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse0 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (= ~t2_i~0 1)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse14 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse8 .cse10 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse6 .cse13 .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (let ((.cse15 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse0 .cse1 (= ~m_st~0 0) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 (<= .cse15 ~token~0) .cse14 (<= ~token~0 .cse15))))) [2019-11-23 22:50:01,945 INFO L440 ceAbstractionStarter]: At program point L205-4(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse24 (= 0 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= 1 ~t1_pc~0)) (.cse23 (= ~m_st~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse25 (= ~m_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse27 (<= 2 ~t1_st~0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (= 0 ~t2_pc~0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse15 (<= 2 ~E_2~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse22 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (let ((.cse28 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse28 ~token~0) .cse19 .cse21 (<= ~token~0 .cse28))) (and .cse12 .cse1 .cse13 .cse15 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse19 .cse21) (and .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse29 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse29) .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse29 ~token~0) .cse16 .cse17 .cse18 .cse19 .cse21)) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse2 .cse23 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2019-11-23 22:50:01,946 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 48) no Hoare annotation was computed. [2019-11-23 22:50:01,946 INFO L440 ceAbstractionStarter]: At program point L205-5(lines 193 207) the Hoare annotation is: (let ((.cse24 (= 0 ~t1_pc~0)) (.cse0 (= ~m_pc~0 1)) (.cse8 (= 0 ~t1_st~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= 1 ~t1_pc~0)) (.cse23 (= ~m_st~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse25 (= ~m_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse27 (<= 2 ~t1_st~0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (= 0 ~t2_pc~0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse15 (<= 2 ~E_2~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse22 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (let ((.cse28 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse28 ~token~0) .cse19 .cse21 (<= ~token~0 .cse28))) (and .cse12 .cse1 .cse13 .cse15 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse19 .cse21) (and .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse29 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse29) .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse29 ~token~0) .cse16 .cse17 .cse18 .cse19 .cse21)) (and .cse1 .cse23 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse1 .cse2 .cse23 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2019-11-23 22:50:01,947 INFO L444 ceAbstractionStarter]: For program point L272(line 272) no Hoare annotation was computed. [2019-11-23 22:50:01,947 INFO L440 ceAbstractionStarter]: At program point L206(lines 190 208) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse9 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~E_2~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (= 0 ~t2_st~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~M_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= ~m_st~0 0) .cse1 .cse3 .cse5 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse7 .cse9 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse11 .cse13 .cse14 .cse15 (= ~local~0 ~token~0) (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse4 .cse6 .cse8 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)))) [2019-11-23 22:50:01,947 INFO L440 ceAbstractionStarter]: At program point L206-1(lines 190 208) the Hoare annotation is: (let ((.cse20 (<= 2 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse24 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse22 (= 1 ~t2_pc~0)) (.cse2 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse1 (= 0 ~t1_pc~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse23 (<= 2 ~t2_st~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse15 (<= 2 ~E_2~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse19 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19) (and .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse24) (and .cse0 .cse22 .cse2 .cse3 .cse4 .cse5 .cse20 .cse7 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse24 .cse19) (and .cse0 .cse22 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2019-11-23 22:50:01,948 INFO L440 ceAbstractionStarter]: At program point L206-2(lines 190 208) the Hoare annotation is: (let ((.cse10 (= 1 ~t2_pc~0)) (.cse14 (<= 2 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse11 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse1 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse16 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~t2_i~0 1)) (.cse18 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15 .cse2 .cse16 .cse17 .cse7 .cse18 .cse8 .cse9) (let ((.cse19 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse19) .cse10 .cse3 .cse4 .cse5 .cse6 .cse12 .cse1 .cse14 .cse2 (<= .cse19 ~token~0) .cse17 .cse7 .cse18 .cse8 .cse9)) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) .cse13 .cse1 .cse15 .cse2 .cse16 .cse17 .cse7 .cse18 .cse8 .cse9))) [2019-11-23 22:50:01,948 INFO L440 ceAbstractionStarter]: At program point L206-3(lines 190 208) the Hoare annotation is: (let ((.cse0 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse16 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse17 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse5 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse6 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse7 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (= ~t2_i~0 1)) (.cse15 (<= 2 ~E_1~0))) (or (let ((.cse14 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0) .cse15 (<= ~token~0 .cse14))) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse8 .cse10 .cse16 (= ~m_pc~0 0) .cse17 .cse2 .cse3 .cse12 .cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse15))) [2019-11-23 22:50:01,949 INFO L440 ceAbstractionStarter]: At program point L206-4(lines 190 208) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse29 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~m_st~0)) (.cse24 (= 0 ~t2_pc~0)) (.cse25 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse26 (= 0 ~t1_pc~0)) (.cse4 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (<= 2 ~T2_E~0)) (.cse28 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse12 (<= 2 ~t2_st~0)) (.cse13 (<= 2 ~E_M~0)) (.cse14 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse15 (<= 2 ~T1_E~0)) (.cse16 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse17 (<= 2 ~E_2~0)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse21 (<= 2 ~E_1~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse13 .cse0 .cse15 .cse17 .cse5 .cse6 .cse27 .cse7 .cse8 .cse19 .cse21 .cse23) (and .cse0 .cse2 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse29 .cse0 .cse1 .cse2 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse30) .cse27 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse23 .cse29 .cse2 .cse4 .cse5 .cse7 .cse25 .cse11 .cse15 (<= .cse30 ~token~0) .cse18 .cse20)) (let ((.cse31 (+ ~local~0 2))) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse23 (<= ~token~0 .cse31) .cse29 .cse2 .cse4 .cse5 .cse7 .cse11 .cse12 .cse15 .cse18 .cse20 (<= .cse31 ~token~0))) (and .cse29 .cse0 .cse1 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) [2019-11-23 22:50:01,949 INFO L440 ceAbstractionStarter]: At program point L206-5(lines 190 208) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse29 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse27 (<= 2 ~m_st~0)) (.cse24 (= 0 ~t2_pc~0)) (.cse25 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse26 (= 0 ~t1_pc~0)) (.cse4 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (<= 2 ~T2_E~0)) (.cse28 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse12 (<= 2 ~t2_st~0)) (.cse13 (<= 2 ~E_M~0)) (.cse14 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse15 (<= 2 ~T1_E~0)) (.cse16 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse17 (<= 2 ~E_2~0)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse21 (<= 2 ~E_1~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse13 .cse0 .cse15 .cse17 .cse5 .cse6 .cse27 .cse7 .cse8 .cse19 .cse21 .cse23) (and .cse0 .cse2 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse29 .cse0 .cse1 .cse2 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse30) .cse27 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse23 .cse29 .cse2 .cse4 .cse5 .cse7 .cse25 .cse11 .cse15 (<= .cse30 ~token~0) .cse18 .cse20)) (let ((.cse31 (+ ~local~0 2))) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse23 (<= ~token~0 .cse31) .cse29 .cse2 .cse4 .cse5 .cse7 .cse11 .cse12 .cse15 .cse18 .cse20 (<= .cse31 ~token~0))) (and .cse29 .cse0 .cse1 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse10 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) [2019-11-23 22:50:01,949 INFO L444 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L372-3(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L339-3(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L175-3(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,950 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-5(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-6(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-8(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-9(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-11(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-12(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,951 INFO L444 ceAbstractionStarter]: For program point L175-14(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L175-15(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L175-17(lines 175 184) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L440 ceAbstractionStarter]: At program point L506(lines 498 508) the Hoare annotation is: (and (= ~local~0 ~token~0) (= ~m_st~0 0) (= 0 ~t1_pc~0) (= ~m_pc~0 0) (= ~t1_i~0 1) (<= 2 ~T2_E~0) (= 0 ~t1_st~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (<= 2 ~M_E~0) (= ~t2_i~0 1) (<= 2 ~E_1~0)) [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L176-2(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,952 INFO L444 ceAbstractionStarter]: For program point L176-3(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,953 INFO L440 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse0 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (<= ULTIMATE.start_activate_threads_~tmp___1~0 0) (= ~t1_i~0 1) (<= 2 ~T2_E~0) (<= 2 ~t1_st~0) (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1)) (= ULTIMATE.start_activate_threads_~tmp___0~0 0) (<= 2 ~t2_st~0) (<= 2 ~E_M~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~t2_i~0 1) (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (<= .cse0 ~token~0) (<= 2 ~E_1~0) (<= ~token~0 .cse0))) [2019-11-23 22:50:01,953 INFO L444 ceAbstractionStarter]: For program point L176-4(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,953 INFO L444 ceAbstractionStarter]: For program point L176-5(lines 176 181) no Hoare annotation was computed. [2019-11-23 22:50:01,953 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2019-11-23 22:50:01,954 INFO L440 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,954 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-23 22:50:01,954 INFO L444 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2019-11-23 22:50:01,954 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2019-11-23 22:50:01,954 INFO L444 ceAbstractionStarter]: For program point L244-1(lines 244 259) no Hoare annotation was computed. [2019-11-23 22:50:01,954 INFO L444 ceAbstractionStarter]: For program point L244-2(lines 244 259) no Hoare annotation was computed. [2019-11-23 22:50:01,955 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-11-23 22:50:01,955 INFO L444 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,955 INFO L444 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,955 INFO L444 ceAbstractionStarter]: For program point L377-3(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,955 INFO L444 ceAbstractionStarter]: For program point L344-3(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,956 INFO L440 ceAbstractionStarter]: At program point L543-1(lines 368 580) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,956 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-11-23 22:50:01,956 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-23 22:50:01,956 INFO L440 ceAbstractionStarter]: At program point L214(lines 221 225) the Hoare annotation is: (and (= ~local~0 ~token~0) (= ~m_st~0 0) (= 0 ~t1_pc~0) (= ~m_pc~0 0) (= ~t1_i~0 1) (<= 2 ~T2_E~0) (= 0 ~t1_st~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= 2 ~E_M~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (<= 2 ~M_E~0) (= ~t2_i~0 1) (<= 2 ~E_1~0)) [2019-11-23 22:50:01,957 INFO L440 ceAbstractionStarter]: At program point L214-1(lines 209 216) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,957 INFO L444 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L440 ceAbstractionStarter]: At program point L281(lines 271 323) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L248-1(lines 248 258) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L248-2(lines 248 258) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L415-2(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,958 INFO L444 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L415-3(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L382-3(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L415-5(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L349-3(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L415-6(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L415-8(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,959 INFO L444 ceAbstractionStarter]: For program point L415-9(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L415-11(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L415-12(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L415-14(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L415-15(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L444 ceAbstractionStarter]: For program point L415-17(lines 415 419) no Hoare annotation was computed. [2019-11-23 22:50:01,960 INFO L440 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-23 22:50:01,961 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:50:01,961 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2019-11-23 22:50:01,961 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2019-11-23 22:50:01,961 INFO L444 ceAbstractionStarter]: For program point L252-1(lines 252 257) no Hoare annotation was computed. [2019-11-23 22:50:01,961 INFO L440 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~M_E~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= ~local~0 ~token~0) (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:50:01,961 INFO L444 ceAbstractionStarter]: For program point L252-2(lines 252 257) no Hoare annotation was computed. [2019-11-23 22:50:01,962 INFO L440 ceAbstractionStarter]: At program point L186-1(lines 174 188) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse13 (= ~token~0 ~local~0)) (.cse20 (= 0 ~t1_pc~0)) (.cse21 (= 0 ~t1_st~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse14 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse8 (<= 2 ~E_M~0)) (.cse18 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse19 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse22 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse17 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse2 .cse14 .cse20 .cse3 .cse4 .cse5 .cse21 .cse17 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse22 .cse11 .cse12) (and .cse0 .cse20 .cse14 .cse3 .cse4 .cse5 .cse21 .cse15 .cse16 .cse17 .cse8 .cse18 .cse9 .cse19 .cse10 .cse22 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12) (and .cse0 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse17 .cse8 .cse18 .cse9 .cse19 .cse10 .cse22 .cse11 .cse12))) [2019-11-23 22:50:01,962 INFO L440 ceAbstractionStarter]: At program point L186-2(lines 174 188) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse1 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse1) (= 1 ~t2_pc~0) .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7 (<= .cse1 ~token~0) .cse8 .cse9 .cse10 .cse11)) (and .cse0 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse3 .cse4 .cse5 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse6 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse7 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse8 .cse9 .cse10 .cse11) (and .cse6 .cse0 .cse7 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse9 .cse10 .cse11))) [2019-11-23 22:50:01,962 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 128) no Hoare annotation was computed. [2019-11-23 22:50:01,962 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2019-11-23 22:50:01,963 INFO L440 ceAbstractionStarter]: At program point L186-3(lines 174 188) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse10 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_2~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7) (let ((.cse11 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse8 (= ~m_st~0 0) .cse4 .cse5 .cse10 .cse0 .cse1 .cse9 .cse6 (<= .cse11 ~token~0) .cse7 (<= ~token~0 .cse11))))) [2019-11-23 22:50:01,963 INFO L440 ceAbstractionStarter]: At program point L186-4(lines 174 188) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 0)) (.cse23 (= 0 ~t1_pc~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse25 (<= 2 ~t2_st~0)) (.cse27 (= ~m_pc~0 1)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse26 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse24 (= 0 ~t1_st~0)) (.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse23 .cse3 .cse4 .cse26 .cse6 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse22 .cse4 .cse26 .cse6 .cse8 .cse7 .cse25 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse12 .cse0 .cse14 .cse16 .cse4 .cse5 .cse26 .cse6 .cse7 .cse18 .cse19 .cse21) (and .cse0 .cse3 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (let ((.cse28 (+ ~local~0 1))) (and .cse27 .cse0 .cse1 (<= ~token~0 .cse28) .cse22 .cse4 .cse26 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse16 (<= .cse28 ~token~0) .cse17 .cse18 .cse19 .cse21)) (and .cse27 .cse0 .cse1 .cse22 .cse4 .cse26 .cse6 .cse7 .cse24 .cse25 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse22 .cse23 .cse3 .cse4 .cse26 .cse6 .cse7 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (let ((.cse29 (+ ~local~0 2))) (and .cse27 .cse0 .cse1 .cse22 .cse2 .cse4 .cse6 .cse8 .cse7 .cse25 .cse12 .cse14 .cse16 .cse17 .cse18 (<= .cse29 ~token~0) .cse19 .cse21 (<= ~token~0 .cse29))) (and .cse27 .cse0 .cse1 .cse3 .cse4 .cse26 .cse6 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2019-11-23 22:50:01,964 INFO L440 ceAbstractionStarter]: At program point L186-5(lines 174 188) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 0)) (.cse26 (= 0 ~t1_pc~0)) (.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse25 (<= 2 ~m_st~0)) (.cse27 (= 0 ~t1_st~0)) (.cse20 (= ~token~0 ~local~0)) (.cse22 (= ~m_pc~0 1)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse11 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse28 (<= 2 ~t2_st~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (<= 2 ~E_1~0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse23 (+ ~local~0 1))) (and .cse22 .cse0 .cse1 (<= ~token~0 .cse23) .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse23 ~token~0) .cse17 .cse18 .cse19 .cse21)) (and .cse0 .cse24 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse26 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse3 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse12 .cse0 .cse14 .cse16 .cse4 .cse5 .cse25 .cse6 .cse7 .cse18 .cse19 .cse21) (and .cse0 .cse24 .cse26 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse22 .cse0 .cse1 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse0 .cse1 .cse24 .cse3 .cse4 .cse25 .cse6 .cse7 .cse27 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse29 (+ ~local~0 2))) (and .cse22 .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse29 ~token~0) .cse19 .cse21 (<= ~token~0 .cse29))))) [2019-11-23 22:50:01,964 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-11-23 22:50:01,964 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2019-11-23 22:50:01,964 INFO L440 ceAbstractionStarter]: At program point L187(lines 171 189) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~M_E~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= ~local~0 ~token~0) (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 .cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse14 .cse15))) [2019-11-23 22:50:01,965 INFO L440 ceAbstractionStarter]: At program point L187-1(lines 171 189) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse13 (= ~token~0 ~local~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse22 (= 0 ~t1_pc~0)) (.cse16 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse23 (= 0 ~t1_st~0)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse8 (<= 2 ~E_M~0)) (.cse20 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse21 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= ~t2_i~0 1)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse21 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse2 .cse16 .cse22 .cse3 .cse4 .cse5 .cse23 .cse19 .cse7 .cse8 .cse20 .cse9 .cse21 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse21 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse22 .cse16 .cse3 .cse4 .cse5 .cse23 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse21 .cse10 .cse14 .cse11 .cse15 .cse12))) [2019-11-23 22:50:01,965 INFO L440 ceAbstractionStarter]: At program point L187-2(lines 171 189) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse1 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse1) (= 1 ~t2_pc~0) .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7 (<= .cse1 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse0 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse3 .cse4 .cse5 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse6 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse7 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse9 .cse11 .cse12))) [2019-11-23 22:50:01,965 INFO L440 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse12 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (<= 2 ~E_2~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse4 .cse5 .cse6 .cse7 .cse12 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse0 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse2 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse3 .cse8 .cse9 .cse10) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) .cse11 .cse4 .cse5 .cse6 .cse7 .cse12 (<= 2 ~t2_st~0) .cse0 .cse2 .cse3 .cse8 .cse9 (= ~token~0 ~local~0)))) [2019-11-23 22:50:01,965 INFO L440 ceAbstractionStarter]: At program point L187-3(lines 171 189) the Hoare annotation is: (let ((.cse0 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (<= 2 ~E_2~0)) (.cse11 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse12 (<= 2 ~m_st~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse3 (<= 2 ~T2_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse2 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_1~0))) (or (let ((.cse9 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse0 (= ~m_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~token~0) .cse10 (<= ~token~0 .cse9))) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse4 .cse5 .cse11 (= ~m_pc~0 0) .cse12 .cse1 .cse3 .cse7 .cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse0 .cse4 .cse5 .cse11 .cse12 .cse6 .cse1 .cse8 .cse3 .cse7 .cse2 .cse10))) [2019-11-23 22:50:01,966 INFO L440 ceAbstractionStarter]: At program point L187-4(lines 171 189) the Hoare annotation is: (let ((.cse26 (= ~m_pc~0 1)) (.cse16 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse29 (= 0 ~t1_pc~0)) (.cse20 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse27 (= 0 ~t1_st~0)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= 0 ~t2_st~0)) (.cse23 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse8 (<= 2 ~E_M~0)) (.cse24 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse25 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse10 (<= 2 ~E_2~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse17 .cse20 .cse2 .cse18 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse26 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (let ((.cse28 (+ ~local~0 1))) (and .cse26 .cse0 .cse16 (<= ~token~0 .cse28) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 (<= .cse28 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 .cse1 .cse17 .cse29 .cse20 .cse2 .cse18 .cse4 .cse5 .cse27 .cse23 .cse7 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse26 .cse0 .cse16 .cse20 .cse2 .cse3 .cse4 .cse5 .cse27 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse1 .cse29 .cse20 .cse2 .cse3 .cse4 .cse5 .cse27 .cse23 .cse7 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse18 .cse3 .cse4 .cse5 .cse12 .cse14 .cse15) (let ((.cse30 (+ ~local~0 2))) (and .cse26 .cse0 .cse16 .cse1 .cse17 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse30 ~token~0) .cse14 .cse15 (<= ~token~0 .cse30))) (and .cse0 .cse17 .cse29 .cse20 .cse2 .cse18 .cse4 .cse5 .cse27 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse29 .cse20 .cse2 .cse3 .cse4 .cse5 .cse27 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:50:01,967 INFO L440 ceAbstractionStarter]: At program point L187-5(lines 171 189) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse0 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse25 (<= 2 ~t2_st~0)) (.cse23 (= ~m_st~0 0)) (.cse24 (= ~m_pc~0 0)) (.cse26 (= ~token~0 ~local~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse29 (= 0 ~t1_pc~0)) (.cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse9 (<= 2 ~T2_E~0)) (.cse30 (= 0 ~t1_st~0)) (.cse28 (= 0 ~t2_pc~0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse13 (<= 2 ~E_M~0)) (.cse14 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse15 (<= 2 ~T1_E~0)) (.cse16 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse17 (<= 2 ~E_2~0)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse21 (<= 2 ~E_1~0)) (.cse22 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse3 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse3 ~token~0) .cse18 .cse19 .cse20 .cse21 .cse22)) (and .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (let ((.cse27 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= .cse27 ~token~0) .cse21 .cse22 (<= ~token~0 .cse27))) (and .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse23 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse4 .cse23 .cse29 .cse5 .cse6 .cse24 .cse8 .cse9 .cse30 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse1 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse13 .cse1 .cse15 .cse17 .cse6 .cse24 .cse7 .cse8 .cse9 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse1 .cse23 .cse29 .cse5 .cse6 .cse24 .cse8 .cse9 .cse30 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse1 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L387-3(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L354-3(lines 333 366) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,967 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-3(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-5(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-6(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-8(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-9(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,968 INFO L444 ceAbstractionStarter]: For program point L156-11(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L156-12(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L156-14(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L156-15(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L156-17(lines 156 165) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,969 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L440 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_2~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (<= 2 ~E_1~0))) (or (and .cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (let ((.cse9 (+ ~local~0 1))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (<= ~token~0 .cse9) (= 1 ~t2_pc~0) .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0 .cse1 .cse2 (<= .cse9 ~token~0) .cse7 .cse8)))) [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L157-4(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L423-2(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,970 INFO L444 ceAbstractionStarter]: For program point L423-3(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,971 INFO L440 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,971 INFO L444 ceAbstractionStarter]: For program point L423-5(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,971 INFO L444 ceAbstractionStarter]: For program point L423-6(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,971 INFO L444 ceAbstractionStarter]: For program point L423-8(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-9(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-11(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-12(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-14(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-15(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,972 INFO L444 ceAbstractionStarter]: For program point L423-17(lines 423 427) no Hoare annotation was computed. [2019-11-23 22:50:01,973 INFO L440 ceAbstractionStarter]: At program point L457(lines 451 459) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,973 INFO L444 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2019-11-23 22:50:01,973 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:50:01,974 INFO L440 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,974 INFO L444 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,974 INFO L440 ceAbstractionStarter]: At program point L359-1(lines 330 367) the Hoare annotation is: (let ((.cse0 (= 0 ~t1_pc~0)) (.cse1 (= ~m_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse5 (= 0 ~t2_pc~0)) (.cse6 (= 0 ~t2_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse10 (<= 2 ~M_E~0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~local~0 ~token~0) (= ~m_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-23 22:50:01,974 INFO L444 ceAbstractionStarter]: For program point L392-3(lines 371 404) no Hoare annotation was computed. [2019-11-23 22:50:01,975 INFO L440 ceAbstractionStarter]: At program point L359-3(lines 330 367) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,975 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,975 INFO L444 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,975 INFO L444 ceAbstractionStarter]: For program point L194-3(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L440 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse20 (<= 2 ~t2_st~0)) (.cse19 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse21 (= ~m_st~0 0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse2 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse22 (= ~m_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse7 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse23 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse9 (= 0 ~t2_pc~0)) (.cse10 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse8 (= 0 ~t2_st~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse15 (<= 2 ~E_2~0)) (.cse24 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= ~t2_i~0 1)) (.cse25 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= ~token~0 ~local~0)) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse4 .cse3 .cse5 .cse6 .cse7 .cse20 .cse11 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse19 .cse21 .cse1 .cse3 .cse22 .cse5 .cse6 .cse7 .cse23 .cse20 .cse11 .cse13 .cse15 .cse24 .cse16 .cse25 .cse17 .cse18 .cse26) (let ((.cse27 (+ ~local~0 1))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (<= ~token~0 .cse27) .cse19 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse13 .cse15 (<= .cse27 ~token~0) .cse16 .cse17)) (and .cse0 .cse11 .cse13 .cse15 .cse3 .cse4 .cse22 .cse5 .cse16 .cse6 .cse17 .cse18) (and .cse0 .cse21 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse23 .cse9 .cse10 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse25 .cse17 .cse26 .cse18))) [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-5(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-6(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-8(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-9(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-11(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-12(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,976 INFO L444 ceAbstractionStarter]: For program point L194-14(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,977 INFO L444 ceAbstractionStarter]: For program point L194-15(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,977 INFO L444 ceAbstractionStarter]: For program point L194-17(lines 194 203) no Hoare annotation was computed. [2019-11-23 22:50:01,977 INFO L440 ceAbstractionStarter]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,978 INFO L440 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,978 INFO L440 ceAbstractionStarter]: At program point L261-1(lines 243 263) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,979 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,979 INFO L440 ceAbstractionStarter]: At program point L261-2(lines 243 263) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,979 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,979 INFO L444 ceAbstractionStarter]: For program point L195-2(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,980 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-23 22:50:01,980 INFO L444 ceAbstractionStarter]: For program point L195-3(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,980 INFO L444 ceAbstractionStarter]: For program point L195-4(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,980 INFO L444 ceAbstractionStarter]: For program point L195-5(lines 195 200) no Hoare annotation was computed. [2019-11-23 22:50:01,981 INFO L440 ceAbstractionStarter]: At program point L295(lines 271 323) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,981 INFO L440 ceAbstractionStarter]: At program point L262(lines 240 264) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse27 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse24 (= ~m_pc~0 1)) (.cse25 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse32 (= ~token~0 ~local~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~T2_E~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse29 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse30 (+ ~local~0 2))) (and .cse24 .cse25 .cse26 .cse1 .cse27 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse21 .cse20 (<= .cse30 ~token~0) .cse22 (<= ~token~0 .cse30))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23) (and .cse26 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse20 .cse22) (and .cse0 .cse25 .cse27 .cse31 .cse7 .cse28 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse0 .cse25 .cse26 .cse27 .cse1 .cse4 .cse31 .cse6 .cse7 .cse28 .cse9 .cse10 .cse29 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23) (let ((.cse33 (+ ~local~0 1))) (and .cse24 .cse25 (<= ~token~0 .cse33) .cse26 .cse4 .cse5 .cse6 .cse28 .cse7 .cse12 .cse14 .cse16 .cse18 (<= .cse33 ~token~0) .cse20 .cse22)) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse32 .cse23) (and .cse0 .cse27 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse29 .cse16 .cse19 .cse21 .cse32) (and .cse24 .cse25 .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22 .cse32) (and .cse26 .cse1 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse29 .cse14 .cse16 .cse18 .cse20 .cse22))) [2019-11-23 22:50:01,982 INFO L440 ceAbstractionStarter]: At program point L262-1(lines 240 264) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,982 INFO L440 ceAbstractionStarter]: At program point L262-2(lines 240 264) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,983 INFO L440 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse2 (= 0 ~t1_pc~0)) (.cse20 (= ~m_pc~0 1)) (.cse7 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse0 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse1 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse22 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse12 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse14 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse27 (= ~token~0 ~local~0)) (.cse25 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse11 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse26 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse17 (= ~t2_i~0 1)) (.cse19 (<= 2 ~E_1~0)) (.cse28 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse24 (+ ~local~0 2))) (and .cse20 .cse21 (= 1 ~t2_pc~0) .cse0 .cse1 .cse22 .cse5 .cse23 .cse6 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= .cse24 ~token~0) .cse19 (<= ~token~0 .cse24))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse23 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19) (and .cse25 .cse22 .cse2 .cse0 .cse1 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse28) (and .cse20 .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse27) (and .cse25 .cse21 .cse0 .cse1 .cse22 .cse26 .cse3 .cse5 .cse6 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse28) (and .cse25 .cse11 .cse13 .cse15 .cse26 .cse4 .cse3 .cse5 .cse6 .cse17 .cse19 .cse28))) [2019-11-23 22:50:01,983 INFO L440 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse1 (= 0 ~t1_pc~0)) (.cse7 (= 0 ~t1_st~0)) (.cse24 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse26 (= 0 ~t2_pc~0)) (.cse13 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse28 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse25 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse27 (= 0 ~t2_st~0)) (.cse10 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse21 (= 1 ~t1_pc~0)) (.cse0 (= 1 ~t2_pc~0)) (.cse2 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse8 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (<= 2 ~E_M~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse20 (<= 2 ~E_1~0)) (.cse29 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse23 (+ ~local~0 2))) (and (= ~m_pc~0 1) .cse21 .cse0 .cse2 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 (<= .cse23 ~token~0) .cse20 (<= ~token~0 .cse23))) (and .cse24 .cse2 .cse1 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse27 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse24 .cse21 .cse4 .cse6 .cse22 .cse8 .cse9 .cse26 .cse12 .cse13 .cse15 .cse16 .cse18 .cse20 .cse28 .cse2 .cse3 .cse25 .cse5 .cse27 .cse10 .cse14 .cse17 .cse19 .cse29) (and .cse21 .cse0 .cse2 .cse4 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29))) [2019-11-23 22:50:01,983 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:50:01,984 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-23 22:50:01,984 INFO L440 ceAbstractionStarter]: At program point L231-1(lines 334 338) the Hoare annotation is: (let ((.cse0 (= 0 ~t1_pc~0)) (.cse1 (= ~m_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse5 (= 0 ~t2_pc~0)) (.cse6 (= 0 ~t2_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse10 (<= 2 ~M_E~0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~local~0 ~token~0) (= ~m_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-23 22:50:01,984 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-23 22:50:01,984 INFO L444 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2019-11-23 22:50:01,985 INFO L440 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,985 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2019-11-23 22:50:01,986 INFO L440 ceAbstractionStarter]: At program point L397-3(lines 368 405) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 0)) (.cse2 (= 0 ~t1_pc~0)) (.cse31 (= ~m_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse24 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T2_E~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse17 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (= ~t2_i~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= ~m_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse27 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse30 .cse31 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse14 .cse0 .cse16 .cse18 .cse4 .cse31 .cse5 .cse6 .cse7 .cse20 .cse22 .cse23) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse8 .cse12 .cse13 .cse16 .cse19 .cse21 .cse26) (and .cse0 .cse24 .cse5 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse32 (+ ~local~0 2))) (and .cse0 .cse24 .cse30 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 (<= ~token~0 .cse32) .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse13 .cse28 .cse16 .cse19 .cse21 (<= .cse32 ~token~0))) (and .cse0 .cse30 .cse2 .cse31 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse27 .cse1 .cse3 .cse4 .cse6 .cse8 .cse13 .cse28 .cse16 .cse19 .cse21 .cse26) (let ((.cse33 (+ ~local~0 1))) (and .cse0 .cse24 (<= ~token~0 .cse33) .cse5 .cse7 .cse29 .cse9 .cse10 .cse14 .cse15 .cse17 .cse18 .cse20 .cse22 .cse23 .cse25 .cse27 .cse1 .cse3 .cse4 .cse6 .cse12 .cse13 .cse16 (<= .cse33 ~token~0) .cse19 .cse21)))) [2019-11-23 22:50:01,986 INFO L440 ceAbstractionStarter]: At program point L596(lines 587 598) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-23 22:50:01,986 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,986 INFO L444 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2019-11-23 22:50:01,986 INFO L440 ceAbstractionStarter]: At program point L431-2(lines 372 376) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~T2_E~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse9 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~E_2~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (= 0 ~t2_st~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~M_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= ~m_st~0 0) .cse1 .cse3 .cse5 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1)) (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse7 .cse9 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse11 .cse13 .cse14 .cse15 (= ~local~0 ~token~0) (<= ULTIMATE.start_activate_threads_~tmp___1~0 0) (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse2 .cse4 .cse6 .cse8 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)))) [2019-11-23 22:50:01,987 INFO L444 ceAbstractionStarter]: For program point L431-3(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,987 INFO L440 ceAbstractionStarter]: At program point L431-5(lines 1 598) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse19 (= 1 ~t1_pc~0)) (.cse23 (= 0 ~t2_pc~0)) (.cse24 (= 0 ~t2_st~0)) (.cse21 (= ~token~0 ~local~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t2_pc~0)) (.cse2 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse22 (= 0 ~t1_pc~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse20 (= 0 ~t1_st~0)) (.cse9 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (<= 2 ~E_2~0)) (.cse25 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (= ~t2_i~0 1)) (.cse26 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse0 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse20 .cse9 .cse8 .cse10 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse26 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse23 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse20 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse26 .cse18))) [2019-11-23 22:50:01,987 INFO L444 ceAbstractionStarter]: For program point L431-6(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,987 INFO L440 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse0 (= 0 ~t1_pc~0)) (.cse1 (= ~m_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse5 (= 0 ~t2_pc~0)) (.cse6 (= 0 ~t2_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse10 (<= 2 ~M_E~0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~local~0 ~token~0) (= ~m_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-23 22:50:01,988 INFO L440 ceAbstractionStarter]: At program point L431-8(lines 1 598) the Hoare annotation is: (let ((.cse13 (= 0 ~t2_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse11 (= 1 ~t2_pc~0)) (.cse16 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse17 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~t2_i~0 1)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~local~0 1))) (and (= ~m_pc~0 1) .cse0 (= 1 ~t1_pc~0) (<= ~token~0 .cse10) .cse11 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse1 .cse2 (<= .cse10 ~token~0) .cse14 .cse7 .cse15 .cse8 .cse9)) (and .cse0 .cse16 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse3 .cse4 .cse5 .cse6 .cse17 .cse12 (= 0 ~t2_pc~0) .cse13 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse1 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse2 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse14 .cse7 .cse15 .cse8 .cse9) (and .cse0 .cse11 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse12 .cse1 (<= 2 ~t2_st~0) .cse2 .cse14 .cse7 .cse15 .cse8 .cse9))) [2019-11-23 22:50:01,988 INFO L440 ceAbstractionStarter]: At program point L167-1(lines 155 169) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse20 (= 0 ~t1_pc~0)) (.cse14 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (<= 2 ~T2_E~0)) (.cse21 (= 0 ~t1_st~0)) (.cse17 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse6 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~t2_st~0)) (.cse18 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse19 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse20 .cse14 .cse2 .cse4 .cse21 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse20 .cse14 .cse2 .cse4 .cse21 .cse17 .cse6 .cse5 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-23 22:50:01,988 INFO L444 ceAbstractionStarter]: For program point L431-9(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,988 INFO L440 ceAbstractionStarter]: At program point L167-2(lines 155 169) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse0 (+ ~local~0 1))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (<= ~token~0 .cse0) .cse1 .cse2 .cse3 (<= 2 ~t2_st~0) .cse4 .cse5 (<= .cse0 ~token~0) .cse6 .cse7 .cse8)) (and .cse4 .cse5 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse1 .cse2 .cse3 (= 0 ~t2_pc~0) (= 0 ~t2_st~0) (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse4 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|) .cse5 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse6 .cse7 .cse8))) [2019-11-23 22:50:01,989 INFO L440 ceAbstractionStarter]: At program point L167-3(lines 155 169) the Hoare annotation is: (let ((.cse0 (= 1 ~t2_pc~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T2_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse8 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 ~token~0) .cse9 (<= ~token~0 .cse8))) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse7 .cse4 .cse9 .cse10) (and .cse5 .cse6 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse7 .cse9 .cse10))) [2019-11-23 22:50:01,989 INFO L440 ceAbstractionStarter]: At program point L431-11(lines 1 598) the Hoare annotation is: (let ((.cse0 (= 1 ~t2_pc~0)) (.cse1 (<= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse2 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (< 0 (+ ULTIMATE.start_activate_threads_~tmp___1~0 1))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse9 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse10 (<= 2 ~T1_E~0)) (.cse12 (<= 2 ~E_2~0)) (.cse18 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse19 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse14 (= ~t2_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse17 (<= 2 ~E_1~0))) (or (let ((.cse16 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse16 ~token~0) .cse17 (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse10 .cse12 .cse18 .cse19 (= ~m_pc~0 0) .cse3 .cse14 .cse5 .cse17 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)))) [2019-11-23 22:50:01,990 INFO L440 ceAbstractionStarter]: At program point L167-4(lines 155 169) the Hoare annotation is: (let ((.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse25 (= ~m_st~0 0)) (.cse26 (= ~m_pc~0 0)) (.cse24 (<= 2 ~t1_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse19 (= 0 ~t1_pc~0)) (.cse2 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T2_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse9 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (<= 2 ~t2_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (<= 2 ~E_2~0)) (.cse20 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= ~t2_i~0 1)) (.cse21 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse16 (<= 2 ~E_1~0)) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse18) (and .cse22 .cse10 .cse23 .cse12 .cse14 .cse3 .cse4 .cse5 .cse15 .cse24 .cse16 .cse18) (and .cse25 .cse19 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse2 .cse3 .cse4 .cse24 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse25 .cse2 .cse26 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse6 .cse22 .cse10 .cse12 .cse14 .cse15 .cse16 .cse18 .cse17) (let ((.cse27 (+ ~local~0 1))) (and .cse0 .cse1 .cse23 (<= ~token~0 .cse27) .cse3 .cse4 .cse5 .cse24 .cse8 .cse10 .cse12 .cse14 (<= .cse27 ~token~0) .cse15 .cse16 .cse18)) (let ((.cse28 (+ ~local~0 2))) (and .cse0 .cse1 .cse23 .cse25 .cse4 .cse5 .cse24 .cse22 .cse10 .cse12 .cse14 .cse20 .cse15 .cse21 (<= .cse28 ~token~0) .cse16 .cse18 (<= ~token~0 .cse28))) (and .cse23 .cse25 .cse19 .cse2 .cse26 .cse4 .cse5 .cse6 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse10 .cse12 .cse14 .cse26 .cse3 .cse4 .cse5 .cse15 .cse16 .cse18) (and .cse1 .cse23 .cse25 .cse26 .cse4 .cse24 .cse5 .cse22 .cse10 .cse12 .cse14 .cse20 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse23 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse18))) [2019-11-23 22:50:01,990 INFO L444 ceAbstractionStarter]: For program point L431-12(lines 431 435) no Hoare annotation was computed. [2019-11-23 22:50:01,990 INFO L440 ceAbstractionStarter]: At program point L167-5(lines 155 169) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse4 (= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0)) (.cse21 (= ~m_pc~0 1)) (.cse0 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse26 (= 0 ~t2_pc~0)) (.cse27 (= 0 ~t2_st~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse23 (= 0 ~t1_pc~0)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse24 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~T2_E~0)) (.cse25 (= 0 ~t1_st~0)) (.cse8 (<= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse9 (<= 2 ~t2_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (<= 0 |ULTIMATE.start_is_transmit2_triggered_#res|)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (<= 2 ~E_2~0)) (.cse15 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= ~t2_i~0 1)) (.cse17 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse18 (<= 2 ~E_1~0)) (.cse20 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse22 (+ ~local~0 2))) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse22 ~token~0) .cse18 .cse20 (<= ~token~0 .cse22))) (and .cse23 .cse3 .cse24 .cse5 .cse6 .cse25 .cse26 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse21 .cse0 .cse3 .cse24 .cse5 .cse6 .cse25 .cse26 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse25 .cse26 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse3 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse10 .cse12 .cse14 .cse4 .cse24 .cse5 .cse6 .cse16 .cse18 .cse20) (and .cse21 .cse0 .cse1 .cse3 .cse24 .cse5 .cse6 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse28 (+ ~local~0 1))) (and .cse21 .cse0 (<= ~token~0 .cse28) .cse1 .cse3 .cse24 .cse5 .cse6 .cse7 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse28 ~token~0) .cse15 .cse16 .cse17 .cse18 .cse20)) (and .cse3 .cse24 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse1 .cse23 .cse3 .cse24 .cse5 .cse6 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20))) [2019-11-23 22:50:02,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:50:02 BoogieIcfgContainer [2019-11-23 22:50:02,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:50:02,207 INFO L168 Benchmark]: Toolchain (without parser) took 57173.97 ms. Allocated memory was 143.1 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,207 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.68 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 103.0 MB in the beginning and 179.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.46 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 175.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,208 INFO L168 Benchmark]: Boogie Preprocessor took 51.13 ms. Allocated memory is still 202.9 MB. Free memory was 175.7 MB in the beginning and 173.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,209 INFO L168 Benchmark]: RCFGBuilder took 926.74 ms. Allocated memory is still 202.9 MB. Free memory was 173.1 MB in the beginning and 119.5 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,210 INFO L168 Benchmark]: TraceAbstraction took 55677.21 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 118.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-11-23 22:50:02,213 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 457.68 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 103.0 MB in the beginning and 179.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.46 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 175.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.13 ms. Allocated memory is still 202.9 MB. Free memory was 175.7 MB in the beginning and 173.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 926.74 ms. Allocated memory is still 202.9 MB. Free memory was 173.1 MB in the beginning and 119.5 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55677.21 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 118.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((0 == \result && local == token) && m_st == 0) && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || ((((((((((0 == \result && 1 == t2_pc) && 2 <= T1_E) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && local == token) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 2 <= M_E) && 0 == \result) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && local + 1 <= token) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((0 == \result && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && token == local) && __retres1 == 0) || ((((((((((((((((((0 == \result && 1 == t1_pc) && __retres1 <= 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && token == local) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= E_M) && 2 <= t2_st) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || (((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((0 == \result && 0 == t1_pc) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((0 == \result && local == token) && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && 0 == t2_st) && 0 == t2_pc) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((1 == t2_pc && tmp___1 <= 0) && 2 <= m_st) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && token == local)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && t2_i == 1) && 2 <= T2_E) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((0 == \result && m_st == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && \result <= 0) && 0 == t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) || (((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) && token == local)) || (((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || ((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((1 == t2_pc && 0 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) || ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((1 == t1_pc && 1 == t2_pc) && tmp___1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((1 == t2_pc && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && 2 <= m_st) && __retres1 == 0) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((tmp___1 <= 0 && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) || ((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((tmp___1 <= 0 && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && m_st == 0) && m_pc == 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 < tmp___1 + 1) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) && token == local) || (((((((((((((((((0 == \result && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && token == local) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t2_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && __retres1 == 0)) || ((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && __retres1 == 0) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token == local) || (((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((0 == \result && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) && token == local) || (((((((((((((0 == \result && 1 == t2_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || (((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || ((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((0 == \result && local == token) && m_st == 0) && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 2 <= M_E) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((((((((((0 == t1_pc && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) || ((((((((((((((local == token && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result)) || ((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((1 == t2_pc && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && tmp___0 == 0) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1) || ((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || ((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 2 <= E_M) && 2 <= t2_st) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 2 <= E_M) && 2 <= t2_st) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || (((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) || (((((((((((((((0 == \result && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && token == local) && __retres1 == 0)) || ((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) && token == local) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((0 == \result && m_pc == 1) && 1 == t1_pc) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && token == local)) || (((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || ((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((((((0 == t1_pc && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) || ((((((((((((((local == token && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == \result && local == token) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 2 <= M_E) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((0 == \result && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || ((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((1 == t2_pc && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && 2 <= m_st) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= T2_E) && t2_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 1 == t2_pc) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result)) || ((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || ((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((1 == t2_pc && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && tmp___0 == 0) && \result <= 0) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && \result <= 0) && 2 <= E_M) && 2 <= t2_st) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 2 <= E_M) && 2 <= t2_st) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 == \result && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) || ((((((((((((((((0 == \result && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0) && token == local)) || ((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && __retres1 == 0)) || (((((((((((((((((0 == \result && 1 == t1_pc) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && token == local) && __retres1 == 0)) || (((((((((((((((((((0 == \result && 1 == t2_pc) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && 0 == t1_pc) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && local == token) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 2 <= M_E) && 0 == \result) - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: (((((((((((((local == token && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1 - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || ((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1)) || ((((((((((0 == \result && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && t2_i == 1) && 2 <= T2_E) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && local + 1 <= token) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((__retres1 <= 0 && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((1 == t1_pc && 1 == t2_pc) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) && token == local) || (((((((((((((((((1 == t1_pc && __retres1 <= 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && token == local) && __retres1 == 0)) || ((((((((((((((((0 == t1_pc && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0)) || ((((((((((((((((1 == t2_pc && 0 == t1_pc) && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= E_M) && 2 <= t2_st) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && __retres1 == 0) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((0 == t1_pc && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((local == token && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2)) || (((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((1 == t2_pc && tmp___1 <= 0) && __retres1 <= 0) && 0 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && 0 == \result) && t2_i == 1) && 2 <= E_1)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((0 == \result && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && tmp___1 <= 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local)) || (((((((((((((1 == t2_pc && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: (((((((((((((local == token && m_st == 0) && 0 == t1_pc) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && 2 <= M_E) && t2_i == 1) && 2 <= E_1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((((((((((m_pc == 1 && 0 == \result) && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && tmp___0 == 0) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0) || (((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && __retres1 <= 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || ((((((((((((((((((0 == t1_pc && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((m_st == 0 && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((((1 == t1_pc && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((1 == t2_pc && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((1 == t2_pc && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((2 <= E_M && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((__retres1 <= 0 && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((1 == t2_pc && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((m_pc == 1 && 1 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && token == local) && __retres1 == 0) || ((((((((((((((((((0 == t1_pc && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && 1 == t2_pc) && 2 <= T1_E) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((m_st == 0 && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((((((((__retres1 <= 0 && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((1 == t1_pc && m_st == 0) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token == local)) || (((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 == t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && m_st == 0) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && local + 2 <= token) && 2 <= E_1) && __retres1 == 0) && token <= local + 2)) || ((((((((((((((((((((1 == t2_pc && m_st == 0) && 0 == t1_pc) && __retres1 <= 0) && m_pc == 0) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || (((((((((2 <= E_M && 2 <= T1_E) && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= T2_E) && 2 <= t2_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && token == local) && __retres1 == 0)) || ((((((((((((((((((1 == t2_pc && 0 == t1_pc) && __retres1 <= 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 2 <= T1_E) && 2 <= E_2) && t2_i == 1) && local + 2 <= token) && 2 <= E_1) && token <= local + 2) || (((((((((1 == t2_pc && 2 <= T1_E) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= T1_E && 2 <= E_2) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == \result && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && 0 == t1_pc) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 0 == t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 0 == t2_st) && \result <= 0) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((((((((((0 == \result && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && \result <= 0) && 2 <= t2_st) && 2 <= E_M) && 0 <= \result) && 2 <= T1_E) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && t2_i == 1) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 2 <= E_2) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= T2_E) && t2_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 0 == t2_pc) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || (((((((((((((((((((((((((0 == \result && 1 == t1_pc) && 2 <= m_st) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && token <= local + 2) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && local + 2 <= token)) || (((((((((((((((((((((((((0 == \result && m_st == 0) && 0 == t1_pc) && m_pc == 0) && 2 <= T2_E) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t1_st) && \result <= 0) && 2 <= t2_st) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && token == local)) || ((((((((((((((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && 2 <= m_st) && 2 <= T2_E) && 2 <= t1_st) && 0 < tmp___1 + 1) && tmp___0 == 0) && 2 <= E_M) && 0 <= \result) && 0 <= __retres1) && 2 <= E_2) && t2_i == 1) && 2 <= E_1) && __retres1 == 0) && m_pc == 1) && 1 == t2_pc) && tmp___1 <= 0) && __retres1 <= 0) && 0 == tmp) && t1_i == 1) && 0 == t2_st) && \result <= 0) && 2 <= T1_E) && local + 1 <= token) && __retres1 == 0) && 0 == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 218 locations, 1 error locations. Result: SAFE, OverallTime: 55.4s, OverallIterations: 24, TraceHistogramMax: 3, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.0s, HoareTripleCheckerStatistics: 7651 SDtfs, 6823 SDslu, 5163 SDs, 0 SdLazy, 417 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7548occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 4588 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 72 PreInvPairs, 1554 NumberOfFragments, 35085 HoareAnnotationTreeSize, 72 FomulaSimplifications, 118957 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 72 FomulaSimplificationsInter, 10498 FormulaSimplificationTreeSizeReductionInter, 40.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2243 ConstructedInterpolants, 0 QuantifiedInterpolants, 421131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 380/380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...