java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:19:48,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:19:48,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:19:48,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:19:48,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:19:48,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:19:48,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:19:48,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:19:48,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:19:48,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:19:48,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:19:48,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:19:48,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:19:48,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:19:48,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:19:48,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:19:48,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:19:48,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:19:48,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:19:48,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:19:48,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:19:48,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:19:48,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:19:48,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:19:48,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:19:48,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:19:48,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:19:48,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:19:48,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:19:48,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:19:48,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:19:48,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:19:48,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:19:48,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:19:48,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:19:48,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:19:48,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:19:48,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:19:48,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:19:48,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:19:48,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:19:48,835 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-10-02 16:19:48,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:19:48,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:19:48,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:19:48,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:19:48,861 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:19:48,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:19:48,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:19:48,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:19:48,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:19:48,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:19:48,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:19:48,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:19:48,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:19:48,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:19:48,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:19:48,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:19:48,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:19:48,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:19:48,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:19:48,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:19:48,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:19:48,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:19:48,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:19:48,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:19:48,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:19:48,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:19:48,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:19:48,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:19:48,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:19:48,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:19:48,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:19:48,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:19:48,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:19:48,957 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:19:48,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-02 16:19:49,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e546bb801/7ddb547105a44245bb8324048569cdd1/FLAGd8d57d2d6 [2019-10-02 16:19:49,558 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:19:49,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-02 16:19:49,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e546bb801/7ddb547105a44245bb8324048569cdd1/FLAGd8d57d2d6 [2019-10-02 16:19:49,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e546bb801/7ddb547105a44245bb8324048569cdd1 [2019-10-02 16:19:49,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:19:49,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:19:49,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:49,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:19:49,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:19:49,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:49" (1/1) ... [2019-10-02 16:19:49,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb64a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:49, skipping insertion in model container [2019-10-02 16:19:49,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:49" (1/1) ... [2019-10-02 16:19:49,879 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:19:49,943 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:19:50,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:50,205 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:19:50,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:50,382 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:19:50,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50 WrapperNode [2019-10-02 16:19:50,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:50,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:19:50,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:19:50,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:19:50,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (1/1) ... [2019-10-02 16:19:50,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:19:50,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:19:50,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:19:50,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:19:50,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (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-10-02 16:19:50,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:19:50,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:19:50,496 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-02 16:19:50,496 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-02 16:19:50,496 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-02 16:19:50,497 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-02 16:19:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-02 16:19:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-02 16:19:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-02 16:19:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-02 16:19:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-02 16:19:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-02 16:19:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-02 16:19:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:19:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:19:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-02 16:19:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-02 16:19:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-02 16:19:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-02 16:19:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-02 16:19:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-02 16:19:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-02 16:19:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-02 16:19:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:19:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:19:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:19:51,233 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:19:51,234 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-02 16:19:51,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:51 BoogieIcfgContainer [2019-10-02 16:19:51,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:19:51,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:19:51,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:19:51,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:19:51,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:19:49" (1/3) ... [2019-10-02 16:19:51,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d48d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:51, skipping insertion in model container [2019-10-02 16:19:51,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:50" (2/3) ... [2019-10-02 16:19:51,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d48d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:51, skipping insertion in model container [2019-10-02 16:19:51,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:51" (3/3) ... [2019-10-02 16:19:51,246 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-10-02 16:19:51,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:19:51,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:19:51,285 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:19:51,338 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:19:51,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:19:51,339 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:19:51,340 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:19:51,340 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:19:51,340 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:19:51,341 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:19:51,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:19:51,342 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:19:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2019-10-02 16:19:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:51,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:51,392 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:51,395 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1386466573, now seen corresponding path program 1 times [2019-10-02 16:19:51,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:51,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:51,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:51,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:51,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:51,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:51,807 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 5 states. [2019-10-02 16:19:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:52,551 INFO L93 Difference]: Finished difference Result 424 states and 630 transitions. [2019-10-02 16:19:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:52,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:52,587 INFO L225 Difference]: With dead ends: 424 [2019-10-02 16:19:52,587 INFO L226 Difference]: Without dead ends: 229 [2019-10-02 16:19:52,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-02 16:19:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-10-02 16:19:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2019-10-02 16:19:52,692 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 105 [2019-10-02 16:19:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:52,693 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2019-10-02 16:19:52,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2019-10-02 16:19:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:52,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:52,698 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:52,698 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 180291377, now seen corresponding path program 1 times [2019-10-02 16:19:52,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:52,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:52,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:52,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:52,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:52,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:52,944 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 5 states. [2019-10-02 16:19:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:53,522 INFO L93 Difference]: Finished difference Result 403 states and 572 transitions. [2019-10-02 16:19:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:53,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:53,527 INFO L225 Difference]: With dead ends: 403 [2019-10-02 16:19:53,527 INFO L226 Difference]: Without dead ends: 229 [2019-10-02 16:19:53,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-02 16:19:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-10-02 16:19:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 267 transitions. [2019-10-02 16:19:53,585 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 267 transitions. Word has length 105 [2019-10-02 16:19:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:53,587 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 267 transitions. [2019-10-02 16:19:53,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 267 transitions. [2019-10-02 16:19:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:53,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:53,593 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:53,593 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash -877546701, now seen corresponding path program 1 times [2019-10-02 16:19:53,594 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:53,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:53,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:53,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:53,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:53,677 INFO L87 Difference]: Start difference. First operand 195 states and 267 transitions. Second operand 5 states. [2019-10-02 16:19:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:54,162 INFO L93 Difference]: Finished difference Result 401 states and 566 transitions. [2019-10-02 16:19:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:54,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:54,169 INFO L225 Difference]: With dead ends: 401 [2019-10-02 16:19:54,169 INFO L226 Difference]: Without dead ends: 227 [2019-10-02 16:19:54,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-02 16:19:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2019-10-02 16:19:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2019-10-02 16:19:54,202 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 105 [2019-10-02 16:19:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:54,203 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2019-10-02 16:19:54,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2019-10-02 16:19:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:54,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:54,206 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:54,206 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2020049167, now seen corresponding path program 1 times [2019-10-02 16:19:54,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:54,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:54,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:54,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:54,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:54,317 INFO L87 Difference]: Start difference. First operand 195 states and 266 transitions. Second operand 5 states. [2019-10-02 16:19:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:54,745 INFO L93 Difference]: Finished difference Result 419 states and 594 transitions. [2019-10-02 16:19:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:54,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:54,750 INFO L225 Difference]: With dead ends: 419 [2019-10-02 16:19:54,750 INFO L226 Difference]: Without dead ends: 245 [2019-10-02 16:19:54,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-02 16:19:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2019-10-02 16:19:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-10-02 16:19:54,786 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 105 [2019-10-02 16:19:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:54,786 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-10-02 16:19:54,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-10-02 16:19:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:54,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:54,789 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:54,789 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1181015505, now seen corresponding path program 1 times [2019-10-02 16:19:54,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:54,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:54,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:54,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:54,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:54,901 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-10-02 16:19:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:55,371 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2019-10-02 16:19:55,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:55,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:55,375 INFO L225 Difference]: With dead ends: 413 [2019-10-02 16:19:55,375 INFO L226 Difference]: Without dead ends: 239 [2019-10-02 16:19:55,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-02 16:19:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-10-02 16:19:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-10-02 16:19:55,409 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 105 [2019-10-02 16:19:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:55,410 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-10-02 16:19:55,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-10-02 16:19:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:55,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:55,412 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:55,413 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1153949903, now seen corresponding path program 1 times [2019-10-02 16:19:55,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:55,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:55,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:55,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:55,524 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 5 states. [2019-10-02 16:19:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:55,935 INFO L93 Difference]: Finished difference Result 415 states and 582 transitions. [2019-10-02 16:19:55,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:55,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:55,938 INFO L225 Difference]: With dead ends: 415 [2019-10-02 16:19:55,938 INFO L226 Difference]: Without dead ends: 241 [2019-10-02 16:19:55,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-02 16:19:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2019-10-02 16:19:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2019-10-02 16:19:55,970 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 105 [2019-10-02 16:19:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:55,971 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2019-10-02 16:19:55,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2019-10-02 16:19:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:55,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:55,973 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:55,973 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1063680495, now seen corresponding path program 1 times [2019-10-02 16:19:55,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:56,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:56,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:56,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:56,061 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand 5 states. [2019-10-02 16:19:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:56,525 INFO L93 Difference]: Finished difference Result 413 states and 576 transitions. [2019-10-02 16:19:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:56,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:56,529 INFO L225 Difference]: With dead ends: 413 [2019-10-02 16:19:56,529 INFO L226 Difference]: Without dead ends: 239 [2019-10-02 16:19:56,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-02 16:19:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-10-02 16:19:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 16:19:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2019-10-02 16:19:56,550 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 105 [2019-10-02 16:19:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:56,550 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2019-10-02 16:19:56,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2019-10-02 16:19:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:56,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:56,552 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:56,552 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1497182351, now seen corresponding path program 1 times [2019-10-02 16:19:56,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:56,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:56,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:56,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:56,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:56,610 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 6 states. [2019-10-02 16:19:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:56,652 INFO L93 Difference]: Finished difference Result 384 states and 534 transitions. [2019-10-02 16:19:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:56,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-02 16:19:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:56,655 INFO L225 Difference]: With dead ends: 384 [2019-10-02 16:19:56,655 INFO L226 Difference]: Without dead ends: 211 [2019-10-02 16:19:56,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-02 16:19:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2019-10-02 16:19:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-02 16:19:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2019-10-02 16:19:56,675 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 105 [2019-10-02 16:19:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:56,675 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2019-10-02 16:19:56,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2019-10-02 16:19:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:56,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:56,677 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:56,677 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -817910097, now seen corresponding path program 1 times [2019-10-02 16:19:56,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:56,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:56,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:56,738 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand 6 states. [2019-10-02 16:19:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:56,785 INFO L93 Difference]: Finished difference Result 391 states and 539 transitions. [2019-10-02 16:19:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:56,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-02 16:19:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:56,788 INFO L225 Difference]: With dead ends: 391 [2019-10-02 16:19:56,788 INFO L226 Difference]: Without dead ends: 213 [2019-10-02 16:19:56,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-02 16:19:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-02 16:19:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-02 16:19:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2019-10-02 16:19:56,809 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 105 [2019-10-02 16:19:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:56,809 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2019-10-02 16:19:56,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2019-10-02 16:19:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:56,811 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:56,812 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash -374009423, now seen corresponding path program 1 times [2019-10-02 16:19:56,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:56,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:56,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:56,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:56,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:56,870 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand 6 states. [2019-10-02 16:19:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:56,912 INFO L93 Difference]: Finished difference Result 398 states and 544 transitions. [2019-10-02 16:19:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:56,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-02 16:19:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:56,914 INFO L225 Difference]: With dead ends: 398 [2019-10-02 16:19:56,914 INFO L226 Difference]: Without dead ends: 215 [2019-10-02 16:19:56,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-02 16:19:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-10-02 16:19:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-02 16:19:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-10-02 16:19:56,933 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 105 [2019-10-02 16:19:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:56,933 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-10-02 16:19:56,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-10-02 16:19:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:56,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:56,935 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:56,935 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1871570031, now seen corresponding path program 1 times [2019-10-02 16:19:56,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:56,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:56,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:56,999 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 6 states. [2019-10-02 16:19:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:57,041 INFO L93 Difference]: Finished difference Result 405 states and 549 transitions. [2019-10-02 16:19:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:57,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-02 16:19:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:57,044 INFO L225 Difference]: With dead ends: 405 [2019-10-02 16:19:57,044 INFO L226 Difference]: Without dead ends: 217 [2019-10-02 16:19:57,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-02 16:19:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-02 16:19:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-02 16:19:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2019-10-02 16:19:57,077 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 105 [2019-10-02 16:19:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:57,078 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2019-10-02 16:19:57,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2019-10-02 16:19:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:57,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:57,080 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:57,080 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1027564529, now seen corresponding path program 1 times [2019-10-02 16:19:57,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:57,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:57,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:57,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:57,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:57,185 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand 5 states. [2019-10-02 16:19:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:57,672 INFO L93 Difference]: Finished difference Result 495 states and 651 transitions. [2019-10-02 16:19:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:57,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:57,676 INFO L225 Difference]: With dead ends: 495 [2019-10-02 16:19:57,676 INFO L226 Difference]: Without dead ends: 303 [2019-10-02 16:19:57,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-02 16:19:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 278. [2019-10-02 16:19:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 16:19:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 355 transitions. [2019-10-02 16:19:57,701 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 355 transitions. Word has length 105 [2019-10-02 16:19:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:57,702 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 355 transitions. [2019-10-02 16:19:57,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 355 transitions. [2019-10-02 16:19:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:57,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:57,704 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:57,704 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1729164403, now seen corresponding path program 1 times [2019-10-02 16:19:57,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:57,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:57,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:57,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:57,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:57,787 INFO L87 Difference]: Start difference. First operand 278 states and 355 transitions. Second operand 5 states. [2019-10-02 16:19:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:58,191 INFO L93 Difference]: Finished difference Result 533 states and 682 transitions. [2019-10-02 16:19:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:58,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:58,194 INFO L225 Difference]: With dead ends: 533 [2019-10-02 16:19:58,194 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 16:19:58,196 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 16:19:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 16:19:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 16:19:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2019-10-02 16:19:58,222 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 105 [2019-10-02 16:19:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:58,222 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2019-10-02 16:19:58,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2019-10-02 16:19:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:58,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:58,224 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:58,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1751796657, now seen corresponding path program 1 times [2019-10-02 16:19:58,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:58,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:58,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:58,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:58,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:58,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:58,322 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand 5 states. [2019-10-02 16:19:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:58,730 INFO L93 Difference]: Finished difference Result 533 states and 678 transitions. [2019-10-02 16:19:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:58,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:58,732 INFO L225 Difference]: With dead ends: 533 [2019-10-02 16:19:58,733 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 16:19:58,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 16:19:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 16:19:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 16:19:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 351 transitions. [2019-10-02 16:19:58,764 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 351 transitions. Word has length 105 [2019-10-02 16:19:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:58,765 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 351 transitions. [2019-10-02 16:19:58,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 351 transitions. [2019-10-02 16:19:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:58,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:58,767 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:58,768 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1156967245, now seen corresponding path program 1 times [2019-10-02 16:19:58,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:58,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:58,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:58,841 INFO L87 Difference]: Start difference. First operand 278 states and 351 transitions. Second operand 5 states. [2019-10-02 16:19:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:59,353 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2019-10-02 16:19:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:59,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:19:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:59,358 INFO L225 Difference]: With dead ends: 634 [2019-10-02 16:19:59,359 INFO L226 Difference]: Without dead ends: 379 [2019-10-02 16:19:59,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-02 16:19:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2019-10-02 16:19:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-02 16:19:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 454 transitions. [2019-10-02 16:19:59,395 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 454 transitions. Word has length 105 [2019-10-02 16:19:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:59,398 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 454 transitions. [2019-10-02 16:19:59,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2019-10-02 16:19:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:19:59,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:59,400 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:59,400 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1666440335, now seen corresponding path program 1 times [2019-10-02 16:19:59,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:59,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:59,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:59,471 INFO L87 Difference]: Start difference. First operand 361 states and 454 transitions. Second operand 5 states. [2019-10-02 16:20:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:00,062 INFO L93 Difference]: Finished difference Result 842 states and 1104 transitions. [2019-10-02 16:20:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:20:00,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:20:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:00,067 INFO L225 Difference]: With dead ends: 842 [2019-10-02 16:20:00,067 INFO L226 Difference]: Without dead ends: 504 [2019-10-02 16:20:00,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:20:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-02 16:20:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 412. [2019-10-02 16:20:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-02 16:20:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 510 transitions. [2019-10-02 16:20:00,113 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 510 transitions. Word has length 105 [2019-10-02 16:20:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:00,113 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 510 transitions. [2019-10-02 16:20:00,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:20:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 510 transitions. [2019-10-02 16:20:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:20:00,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:00,116 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:20:00,117 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 256787699, now seen corresponding path program 1 times [2019-10-02 16:20:00,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:00,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:20:00,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:00,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:20:00,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:20:00,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:20:00,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:20:00,192 INFO L87 Difference]: Start difference. First operand 412 states and 510 transitions. Second operand 5 states. [2019-10-02 16:20:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:00,764 INFO L93 Difference]: Finished difference Result 915 states and 1184 transitions. [2019-10-02 16:20:00,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:20:00,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:20:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:00,770 INFO L225 Difference]: With dead ends: 915 [2019-10-02 16:20:00,770 INFO L226 Difference]: Without dead ends: 526 [2019-10-02 16:20:00,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:20:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-10-02 16:20:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 453. [2019-10-02 16:20:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-10-02 16:20:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2019-10-02 16:20:00,842 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 105 [2019-10-02 16:20:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:00,843 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2019-10-02 16:20:00,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:20:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2019-10-02 16:20:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:20:00,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:00,849 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:20:00,849 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash 318827313, now seen corresponding path program 1 times [2019-10-02 16:20:00,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:00,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:00,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:00,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:20:01,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:01,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:20:01,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:20:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:20:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:20:01,026 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand 5 states. [2019-10-02 16:20:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:01,648 INFO L93 Difference]: Finished difference Result 961 states and 1228 transitions. [2019-10-02 16:20:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:20:01,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-02 16:20:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:01,652 INFO L225 Difference]: With dead ends: 961 [2019-10-02 16:20:01,653 INFO L226 Difference]: Without dead ends: 531 [2019-10-02 16:20:01,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:20:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-02 16:20:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 484. [2019-10-02 16:20:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-02 16:20:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 580 transitions. [2019-10-02 16:20:01,699 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 580 transitions. Word has length 105 [2019-10-02 16:20:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:01,700 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 580 transitions. [2019-10-02 16:20:01,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:20:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 580 transitions. [2019-10-02 16:20:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 16:20:01,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:01,701 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:20:01,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:01,702 INFO L82 PathProgramCache]: Analyzing trace with hash 184813807, now seen corresponding path program 1 times [2019-10-02 16:20:01,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:01,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:01,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:01,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:01,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:20:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:01,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:20:01,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:20:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:20:01,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:20:01,756 INFO L87 Difference]: Start difference. First operand 484 states and 580 transitions. Second operand 3 states. [2019-10-02 16:20:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:01,838 INFO L93 Difference]: Finished difference Result 1381 states and 1703 transitions. [2019-10-02 16:20:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:20:01,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-02 16:20:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:01,844 INFO L225 Difference]: With dead ends: 1381 [2019-10-02 16:20:01,845 INFO L226 Difference]: Without dead ends: 920 [2019-10-02 16:20:01,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-02 16:20:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-02 16:20:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 919. [2019-10-02 16:20:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-10-02 16:20:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1114 transitions. [2019-10-02 16:20:01,924 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1114 transitions. Word has length 105 [2019-10-02 16:20:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:01,924 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1114 transitions. [2019-10-02 16:20:01,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:20:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1114 transitions. [2019-10-02 16:20:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 16:20:01,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:01,928 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:01,929 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1241286252, now seen corresponding path program 1 times [2019-10-02 16:20:01,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:01,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 16:20:02,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:02,008 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:02,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:20:02,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:20:02,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:02,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:20:02,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:20:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:20:02,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:20:02,242 INFO L87 Difference]: Start difference. First operand 919 states and 1114 transitions. Second operand 5 states. [2019-10-02 16:20:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:02,673 INFO L93 Difference]: Finished difference Result 2663 states and 3354 transitions. [2019-10-02 16:20:02,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:20:02,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-02 16:20:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:02,685 INFO L225 Difference]: With dead ends: 2663 [2019-10-02 16:20:02,686 INFO L226 Difference]: Without dead ends: 1767 [2019-10-02 16:20:02,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:20:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-10-02 16:20:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1758. [2019-10-02 16:20:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2019-10-02 16:20:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2083 transitions. [2019-10-02 16:20:02,836 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2083 transitions. Word has length 170 [2019-10-02 16:20:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:02,837 INFO L475 AbstractCegarLoop]: Abstraction has 1758 states and 2083 transitions. [2019-10-02 16:20:02,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:20:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2083 transitions. [2019-10-02 16:20:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 16:20:02,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:02,842 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:02,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2103787486, now seen corresponding path program 1 times [2019-10-02 16:20:02,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:02,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:02,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 16:20:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:02,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:20:02,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:20:02,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:20:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:20:02,908 INFO L87 Difference]: Start difference. First operand 1758 states and 2083 transitions. Second operand 4 states. [2019-10-02 16:20:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:03,431 INFO L93 Difference]: Finished difference Result 4997 states and 5980 transitions. [2019-10-02 16:20:03,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:20:03,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-10-02 16:20:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:03,453 INFO L225 Difference]: With dead ends: 4997 [2019-10-02 16:20:03,453 INFO L226 Difference]: Without dead ends: 2511 [2019-10-02 16:20:03,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:20:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-10-02 16:20:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2019-10-02 16:20:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2019-10-02 16:20:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 2966 transitions. [2019-10-02 16:20:03,770 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 2966 transitions. Word has length 169 [2019-10-02 16:20:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:03,771 INFO L475 AbstractCegarLoop]: Abstraction has 2511 states and 2966 transitions. [2019-10-02 16:20:03,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:20:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 2966 transitions. [2019-10-02 16:20:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 16:20:03,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:03,785 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:03,785 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1557384399, now seen corresponding path program 1 times [2019-10-02 16:20:03,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:03,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 16:20:03,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:03,946 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:03,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:20:04,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 16:20:04,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:04,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 16:20:04,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:20:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:20:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:20:04,288 INFO L87 Difference]: Start difference. First operand 2511 states and 2966 transitions. Second operand 7 states. [2019-10-02 16:20:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:05,444 INFO L93 Difference]: Finished difference Result 6431 states and 7914 transitions. [2019-10-02 16:20:05,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 16:20:05,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-10-02 16:20:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:05,476 INFO L225 Difference]: With dead ends: 6431 [2019-10-02 16:20:05,477 INFO L226 Difference]: Without dead ends: 3943 [2019-10-02 16:20:05,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 16:20:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-10-02 16:20:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3943. [2019-10-02 16:20:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3943 states. [2019-10-02 16:20:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 4619 transitions. [2019-10-02 16:20:06,019 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 4619 transitions. Word has length 222 [2019-10-02 16:20:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:06,020 INFO L475 AbstractCegarLoop]: Abstraction has 3943 states and 4619 transitions. [2019-10-02 16:20:06,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:20:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 4619 transitions. [2019-10-02 16:20:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 16:20:06,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:06,032 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:06,032 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1473110279, now seen corresponding path program 1 times [2019-10-02 16:20:06,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 16:20:06,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:06,123 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:20:06,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 16:20:06,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 16:20:06,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:20:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:20:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:20:06,360 INFO L87 Difference]: Start difference. First operand 3943 states and 4619 transitions. Second operand 3 states. [2019-10-02 16:20:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:06,702 INFO L93 Difference]: Finished difference Result 7843 states and 9245 transitions. [2019-10-02 16:20:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:20:06,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-02 16:20:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:06,724 INFO L225 Difference]: With dead ends: 7843 [2019-10-02 16:20:06,725 INFO L226 Difference]: Without dead ends: 3925 [2019-10-02 16:20:06,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 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-10-02 16:20:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2019-10-02 16:20:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3925. [2019-10-02 16:20:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2019-10-02 16:20:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4567 transitions. [2019-10-02 16:20:07,070 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4567 transitions. Word has length 244 [2019-10-02 16:20:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:07,071 INFO L475 AbstractCegarLoop]: Abstraction has 3925 states and 4567 transitions. [2019-10-02 16:20:07,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:20:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4567 transitions. [2019-10-02 16:20:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 16:20:07,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:07,083 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:07,083 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash 685665299, now seen corresponding path program 1 times [2019-10-02 16:20:07,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:07,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:07,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:07,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:07,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-02 16:20:07,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:07,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:07,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:20:07,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 16:20:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 16:20:07,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:20:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:20:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:20:07,436 INFO L87 Difference]: Start difference. First operand 3925 states and 4567 transitions. Second operand 6 states. [2019-10-02 16:20:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:10,733 INFO L93 Difference]: Finished difference Result 18514 states and 22603 transitions. [2019-10-02 16:20:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 16:20:10,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 244 [2019-10-02 16:20:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:10,826 INFO L225 Difference]: With dead ends: 18514 [2019-10-02 16:20:10,827 INFO L226 Difference]: Without dead ends: 12258 [2019-10-02 16:20:10,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:20:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-10-02 16:20:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 12095. [2019-10-02 16:20:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12095 states. [2019-10-02 16:20:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 14559 transitions. [2019-10-02 16:20:12,208 INFO L78 Accepts]: Start accepts. Automaton has 12095 states and 14559 transitions. Word has length 244 [2019-10-02 16:20:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:12,208 INFO L475 AbstractCegarLoop]: Abstraction has 12095 states and 14559 transitions. [2019-10-02 16:20:12,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:20:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12095 states and 14559 transitions. [2019-10-02 16:20:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 16:20:12,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:12,241 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:12,241 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1021381807, now seen corresponding path program 1 times [2019-10-02 16:20:12,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-02 16:20:12,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:12,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:20:12,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:20:12,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:20:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:20:12,354 INFO L87 Difference]: Start difference. First operand 12095 states and 14559 transitions. Second operand 4 states. [2019-10-02 16:20:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:13,822 INFO L93 Difference]: Finished difference Result 12098 states and 14561 transitions. [2019-10-02 16:20:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:20:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-10-02 16:20:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:13,863 INFO L225 Difference]: With dead ends: 12098 [2019-10-02 16:20:13,863 INFO L226 Difference]: Without dead ends: 9157 [2019-10-02 16:20:13,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:20:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2019-10-02 16:20:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 9157. [2019-10-02 16:20:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9157 states. [2019-10-02 16:20:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9157 states to 9157 states and 11147 transitions. [2019-10-02 16:20:14,788 INFO L78 Accepts]: Start accepts. Automaton has 9157 states and 11147 transitions. Word has length 299 [2019-10-02 16:20:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:14,789 INFO L475 AbstractCegarLoop]: Abstraction has 9157 states and 11147 transitions. [2019-10-02 16:20:14,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:20:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9157 states and 11147 transitions. [2019-10-02 16:20:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-10-02 16:20:14,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:14,825 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:14,825 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -984890599, now seen corresponding path program 1 times [2019-10-02 16:20:14,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:14,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-10-02 16:20:15,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:15,139 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:15,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:20:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-02 16:20:15,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:15,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 16:20:15,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 16:20:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 16:20:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:20:15,566 INFO L87 Difference]: Start difference. First operand 9157 states and 11147 transitions. Second operand 9 states. [2019-10-02 16:20:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:16,599 INFO L93 Difference]: Finished difference Result 15367 states and 19404 transitions. [2019-10-02 16:20:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 16:20:16,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 410 [2019-10-02 16:20:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:16,649 INFO L225 Difference]: With dead ends: 15367 [2019-10-02 16:20:16,649 INFO L226 Difference]: Without dead ends: 6235 [2019-10-02 16:20:16,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-10-02 16:20:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2019-10-02 16:20:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 5917. [2019-10-02 16:20:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5917 states. [2019-10-02 16:20:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 6925 transitions. [2019-10-02 16:20:17,213 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 6925 transitions. Word has length 410 [2019-10-02 16:20:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:17,216 INFO L475 AbstractCegarLoop]: Abstraction has 5917 states and 6925 transitions. [2019-10-02 16:20:17,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 16:20:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 6925 transitions. [2019-10-02 16:20:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 16:20:17,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:17,234 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:17,234 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 243242576, now seen corresponding path program 1 times [2019-10-02 16:20:17,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 16:20:17,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:17,357 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:17,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 16:20:17,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 16:20:17,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:17,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 16:20:17,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:20:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:20:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:20:17,697 INFO L87 Difference]: Start difference. First operand 5917 states and 6925 transitions. Second operand 6 states. [2019-10-02 16:20:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:19,454 INFO L93 Difference]: Finished difference Result 12591 states and 15234 transitions. [2019-10-02 16:20:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 16:20:19,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 300 [2019-10-02 16:20:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:19,477 INFO L225 Difference]: With dead ends: 12591 [2019-10-02 16:20:19,477 INFO L226 Difference]: Without dead ends: 4772 [2019-10-02 16:20:19,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-10-02 16:20:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-10-02 16:20:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4416. [2019-10-02 16:20:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-10-02 16:20:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 4849 transitions. [2019-10-02 16:20:20,031 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 4849 transitions. Word has length 300 [2019-10-02 16:20:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:20,032 INFO L475 AbstractCegarLoop]: Abstraction has 4416 states and 4849 transitions. [2019-10-02 16:20:20,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:20:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 4849 transitions. [2019-10-02 16:20:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 16:20:20,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:20,051 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:20,051 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 623376249, now seen corresponding path program 1 times [2019-10-02 16:20:20,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:20,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:20,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:20,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:20,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 16:20:20,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:20:20,192 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:20:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:20,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 16:20:20,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:20:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-02 16:20:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:20:20,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:20:20,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:20:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:20:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:20:20,538 INFO L87 Difference]: Start difference. First operand 4416 states and 4849 transitions. Second operand 5 states. [2019-10-02 16:20:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:21,031 INFO L93 Difference]: Finished difference Result 5342 states and 5847 transitions. [2019-10-02 16:20:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:20:21,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-10-02 16:20:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:21,037 INFO L225 Difference]: With dead ends: 5342 [2019-10-02 16:20:21,037 INFO L226 Difference]: Without dead ends: 1257 [2019-10-02 16:20:21,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:20:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-10-02 16:20:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2019-10-02 16:20:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-10-02 16:20:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1350 transitions. [2019-10-02 16:20:21,164 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1350 transitions. Word has length 305 [2019-10-02 16:20:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:21,164 INFO L475 AbstractCegarLoop]: Abstraction has 1257 states and 1350 transitions. [2019-10-02 16:20:21,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:20:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1350 transitions. [2019-10-02 16:20:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 16:20:21,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:20:21,173 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 16:20:21,174 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:20:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:20:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 883178109, now seen corresponding path program 1 times [2019-10-02 16:20:21,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:20:21,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:20:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:21,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:20:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:20:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:20:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-10-02 16:20:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:20:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 16:20:21,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 16:20:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 16:20:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 16:20:21,480 INFO L87 Difference]: Start difference. First operand 1257 states and 1350 transitions. Second operand 8 states. [2019-10-02 16:20:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:20:23,148 INFO L93 Difference]: Finished difference Result 1287 states and 1388 transitions. [2019-10-02 16:20:23,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 16:20:23,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 374 [2019-10-02 16:20:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:20:23,151 INFO L225 Difference]: With dead ends: 1287 [2019-10-02 16:20:23,151 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:20:23,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-02 16:20:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:20:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:20:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:20:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:20:23,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 374 [2019-10-02 16:20:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:20:23,157 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:20:23,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 16:20:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:20:23,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:20:23,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:20:23,563 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 145 [2019-10-02 16:20:24,987 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-10-02 16:20:26,116 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 213 [2019-10-02 16:20:26,447 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 152 [2019-10-02 16:20:27,616 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 115 [2019-10-02 16:20:33,513 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 213 [2019-10-02 16:20:37,411 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 176 [2019-10-02 16:20:41,422 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 176 [2019-10-02 16:20:45,840 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 1 [2019-10-02 16:20:46,776 WARN L191 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-10-02 16:20:57,794 WARN L191 SmtUtils]: Spent 11.01 s on a formula simplification. DAG size of input: 339 DAG size of output: 238 [2019-10-02 16:20:58,884 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 189 DAG size of output: 143 [2019-10-02 16:21:03,959 WARN L191 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 176 DAG size of output: 136 [2019-10-02 16:21:04,946 WARN L191 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2019-10-02 16:21:18,762 WARN L191 SmtUtils]: Spent 13.80 s on a formula simplification. DAG size of input: 303 DAG size of output: 126 [2019-10-02 16:21:29,708 WARN L191 SmtUtils]: Spent 10.92 s on a formula simplification. DAG size of input: 331 DAG size of output: 132 [2019-10-02 16:21:32,852 WARN L191 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 148 DAG size of output: 104 [2019-10-02 16:21:38,431 WARN L191 SmtUtils]: Spent 5.57 s on a formula simplification. DAG size of input: 200 DAG size of output: 169 [2019-10-02 16:21:39,026 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-10-02 16:21:39,133 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-02 16:21:40,612 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-10-02 16:21:41,040 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 1 [2019-10-02 16:21:45,911 WARN L191 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 182 DAG size of output: 115 [2019-10-02 16:21:55,181 WARN L191 SmtUtils]: Spent 9.25 s on a formula simplification. DAG size of input: 213 DAG size of output: 103 [2019-10-02 16:21:56,076 WARN L191 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-10-02 16:22:01,890 WARN L191 SmtUtils]: Spent 5.81 s on a formula simplification. DAG size of input: 201 DAG size of output: 174 [2019-10-02 16:22:13,151 WARN L191 SmtUtils]: Spent 11.25 s on a formula simplification. DAG size of input: 339 DAG size of output: 238 [2019-10-02 16:22:17,293 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 153 DAG size of output: 116 [2019-10-02 16:22:21,164 WARN L191 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 156 DAG size of output: 102 [2019-10-02 16:22:34,344 WARN L191 SmtUtils]: Spent 13.16 s on a formula simplification. DAG size of input: 309 DAG size of output: 179 [2019-10-02 16:22:34,450 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2019-10-02 16:22:34,569 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2019-10-02 16:22:35,188 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-10-02 16:22:46,259 WARN L191 SmtUtils]: Spent 11.05 s on a formula simplification. DAG size of input: 308 DAG size of output: 141 [2019-10-02 16:22:46,478 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 59 [2019-10-02 16:22:50,607 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 196 DAG size of output: 165 [2019-10-02 16:23:06,197 WARN L191 SmtUtils]: Spent 15.57 s on a formula simplification. DAG size of input: 317 DAG size of output: 175 [2019-10-02 16:23:08,965 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 161 DAG size of output: 93 [2019-10-02 16:23:18,040 WARN L191 SmtUtils]: Spent 9.06 s on a formula simplification. DAG size of input: 312 DAG size of output: 122 [2019-10-02 16:23:22,544 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2019-10-02 16:23:26,096 WARN L191 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 153 DAG size of output: 102 [2019-10-02 16:23:30,949 WARN L191 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 183 DAG size of output: 143 [2019-10-02 16:23:32,063 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 214 DAG size of output: 131 [2019-10-02 16:23:35,769 WARN L191 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 169 DAG size of output: 105 [2019-10-02 16:23:43,321 WARN L191 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 331 DAG size of output: 115 [2019-10-02 16:23:43,600 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 1 [2019-10-02 16:23:49,143 WARN L191 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 175 DAG size of output: 145 [2019-10-02 16:23:49,419 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2019-10-02 16:23:49,689 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-10-02 16:23:53,027 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 147 DAG size of output: 98 [2019-10-02 16:23:58,326 WARN L191 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 186 DAG size of output: 152 [2019-10-02 16:23:58,446 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-02 16:23:59,159 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 96 [2019-10-02 16:23:59,445 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-10-02 16:24:01,915 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-10-02 16:24:14,968 WARN L191 SmtUtils]: Spent 13.03 s on a formula simplification. DAG size of input: 317 DAG size of output: 178 [2019-10-02 16:24:18,751 WARN L191 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 156 DAG size of output: 105 [2019-10-02 16:24:19,028 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2019-10-02 16:24:19,993 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2019-10-02 16:24:20,875 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-10-02 16:24:24,538 WARN L191 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 153 DAG size of output: 102 [2019-10-02 16:24:25,668 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 214 DAG size of output: 131 [2019-10-02 16:24:25,875 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 1 [2019-10-02 16:24:32,585 WARN L191 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 220 DAG size of output: 124 [2019-10-02 16:24:36,581 WARN L191 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 175 DAG size of output: 129 [2019-10-02 16:24:42,316 WARN L191 SmtUtils]: Spent 5.73 s on a formula simplification. DAG size of input: 217 DAG size of output: 179 [2019-10-02 16:24:45,413 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 147 DAG size of output: 100 [2019-10-02 16:24:47,544 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 148 DAG size of output: 84 [2019-10-02 16:24:52,476 WARN L191 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2019-10-02 16:24:53,362 WARN L191 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-10-02 16:24:53,754 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 1 [2019-10-02 16:25:04,712 WARN L191 SmtUtils]: Spent 10.94 s on a formula simplification. DAG size of input: 308 DAG size of output: 141 [2019-10-02 16:25:05,092 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 1 [2019-10-02 16:25:05,301 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 53 [2019-10-02 16:25:10,396 WARN L191 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 181 DAG size of output: 144 [2019-10-02 16:25:11,286 WARN L191 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2019-10-02 16:25:17,207 WARN L191 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 231 DAG size of output: 182 [2019-10-02 16:25:19,117 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 138 DAG size of output: 69 [2019-10-02 16:25:20,566 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-10-02 16:25:23,916 WARN L191 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 169 DAG size of output: 109 [2019-10-02 16:25:24,987 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 189 DAG size of output: 143 [2019-10-02 16:25:25,256 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2019-10-02 16:25:25,523 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2019-10-02 16:25:30,693 WARN L191 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 174 DAG size of output: 114 [2019-10-02 16:25:30,696 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-02 16:25:30,698 INFO L439 ceAbstractionStarter]: At program point transmit1ENTRY(lines 86 121) the Hoare annotation is: (let ((.cse33 (= 1 ~t1_pc~0))) (let ((.cse13 (= |old(~t1_pc~0)| 1)) (.cse34 (<= 2 ~m_st~0)) (.cse15 (= ~m_st~0 0)) (.cse35 (<= ~token~0 ~local~0)) (.cse16 (= ~E_2~0 |old(~E_2~0)|)) (.cse17 (= |old(~t2_st~0)| ~t2_st~0)) (.cse18 (not .cse33)) (.cse19 (<= 2 ~t3_st~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (<= ~local~0 ~token~0))) (let ((.cse38 (and .cse15 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20 .cse36)) (.cse28 (not (= 1 ~t2_pc~0))) (.cse42 (and .cse34 .cse16 .cse17 .cse18 .cse20)) (.cse2 (not (<= ~t2_pc~0 0))) (.cse29 (not (<= |old(~token~0)| ~local~0))) (.cse41 (and .cse15 .cse35 .cse16 .cse17 .cse18 .cse20 .cse36)) (.cse30 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse25 (not (<= 2 |old(~E_2~0)|))) (.cse39 (and .cse34 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse27 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 0 ~E_3~0)) (.cse31 (not .cse13)) (.cse4 (= ~T3_E~0 1)) (.cse32 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 |old(~t3_st~0)|))) (.cse40 (= 1 ~t3_pc~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse22 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_3~0)) (.cse9 (= 1 ~E_1~0)) (.cse24 (= 0 ~E_1~0)) (.cse26 (= 0 ~E_M~0)) (.cse37 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse28 .cse29 .cse30 (or .cse0 .cse1 .cse12 .cse31 .cse3 .cse4 .cse32 .cse14 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11) (and .cse33 .cse34 .cse35 .cse16 .cse17 .cse19 .cse20 .cse36)) (or (and .cse33 .cse34 .cse16) .cse0 .cse1 .cse12 .cse31 .cse4 .cse32 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse26 .cse37 .cse27) (or .cse0 .cse1 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse38 .cse12 .cse30 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse32 .cse14 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse39 .cse10 .cse25 .cse26 .cse11) (or .cse28 (and .cse33 .cse34 .cse35 .cse16 .cse17 .cse20 .cse36) .cse29 .cse30 (or .cse0 .cse1 .cse12 .cse31 .cse3 .cse4 .cse32 .cse40 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11)) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse40 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse30 .cse13 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse12 .cse31 .cse4 .cse32 .cse40 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 (and .cse33 .cse34 .cse16 .cse17 .cse20) .cse24 .cse10 .cse25 .cse26 .cse11) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse38 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse6 .cse7 .cse8 (and .cse15 .cse16 .cse17 .cse18 .cse20) .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse12 .cse4 .cse13 .cse32 .cse5 .cse6 .cse7 (and .cse34 .cse16 .cse18) .cse21 .cse22 .cse8 .cse9 .cse24 .cse26 .cse37 .cse27) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse32 .cse40 .cse5 .cse42 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11) (or .cse0 (and .cse33 .cse34 .cse16 .cse17 .cse19 .cse20) .cse1 .cse2 .cse12 .cse31 .cse4 .cse32 .cse14 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse13 .cse32 .cse40 .cse5 .cse6 .cse7 .cse42 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11) (or .cse0 .cse1 .cse12 .cse4 .cse13 .cse32 .cse14 .cse40 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 (and .cse34 .cse16 .cse18 .cse19 .cse20) .cse24 .cse26 .cse37 .cse11) (or .cse0 .cse1 .cse2 .cse29 .cse4 .cse5 .cse40 .cse6 .cse7 .cse8 .cse9 .cse41 .cse10 .cse11 .cse12 .cse30 .cse13 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse13 .cse32 .cse14 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse24 .cse10 .cse25 .cse26 .cse39 .cse11) (or .cse0 .cse1 .cse12 (and .cse15 .cse16 .cse18 .cse19 .cse20) .cse4 .cse13 .cse14 .cse40 .cse5 .cse6 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse26 .cse37 .cse11 .cse27) (or .cse0 .cse1 .cse12 .cse31 .cse4 .cse32 .cse14 .cse40 .cse5 .cse6 .cse7 .cse21 (and .cse33 .cse34 .cse16 .cse19 .cse20) .cse22 .cse8 .cse9 .cse24 .cse26 .cse37 .cse11))))) [2019-10-02 16:25:30,698 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-02 16:25:30,699 INFO L439 ceAbstractionStarter]: At program point L94(lines 89 120) the Hoare annotation is: (let ((.cse24 (<= ~token~0 ~local~0)) (.cse26 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~t3_st~0)) (.cse11 (= 1 ~t1_pc~0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~E_2~0 |old(~E_2~0)|)) (.cse25 (= |old(~t2_st~0)| ~t2_st~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= 0 |old(~E_2~0)|)) (.cse27 (not (<= |old(~token~0)| ~local~0))) (.cse28 (not (<= ~local~0 |old(~token~0)|))) (.cse23 (not (= 1 ~t2_pc~0))) (.cse32 (not (<= ~t2_pc~0 0))) (.cse5 (not (<= 2 |old(~t3_st~0)|))) (.cse34 (not (= 0 |old(~m_st~0)|))) (.cse35 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse29 (= 0 |old(~t2_st~0)|)) (.cse3 (= ~T3_E~0 1)) (.cse33 (= |old(~t1_pc~0)| 1)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= 1 ~t3_pc~0)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse16 (= ~T1_E~0 1)) (.cse17 (= 1 ~E_3~0)) (.cse18 (= 1 ~E_1~0)) (.cse19 (= 0 ~E_1~0)) (.cse30 (not (= 1 ~t1_i~0))) (.cse31 (not (<= 2 |old(~E_2~0)|))) (.cse20 (= 0 ~E_M~0)) (.cse22 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 (and .cse11 .cse12 .cse24 .cse13 .cse25 .cse15 .cse26) .cse27 .cse28 (or .cse0 .cse1 .cse2 .cse29 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22)) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse33 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22) (or .cse0 .cse1 .cse32 .cse27 .cse3 .cse7 .cse8 .cse9 .cse17 .cse18 .cse30 .cse22 .cse2 .cse28 .cse33 .cse5 .cse10 .cse16 .cse34 .cse19 .cse31 .cse20 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse34 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse35) (or (and .cse11 .cse12 .cse13) .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse32 .cse27 .cse3 .cse7 .cse6 .cse8 .cse9 .cse17 .cse18 .cse30 .cse22 .cse2 .cse28 .cse33 .cse10 .cse16 .cse34 .cse19 .cse31 .cse20 .cse35) (or .cse0 .cse1 .cse27 .cse29 .cse3 .cse7 .cse8 .cse9 .cse17 .cse18 .cse30 .cse22 .cse2 .cse28 .cse33 .cse5 .cse10 .cse23 .cse16 .cse34 .cse19 .cse31 .cse20 .cse35) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse33 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22) (or .cse0 .cse1 .cse32 .cse2 .cse29 .cse3 .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse34 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22 .cse35) (or .cse23 .cse27 .cse28 (or .cse0 .cse1 .cse2 .cse29 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22) (and .cse11 .cse12 .cse24 .cse13 .cse25 .cse14 .cse15 .cse26)) (or .cse0 (and .cse11 .cse12 .cse13 .cse25 .cse14 .cse15) .cse1 .cse32 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22) (or .cse0 .cse1 .cse2 .cse29 .cse3 .cse33 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 (and .cse11 .cse12 .cse13 .cse25 .cse15) .cse19 .cse30 .cse31 .cse20 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse27 .cse29 .cse3 .cse7 .cse6 .cse8 .cse9 .cse17 .cse18 .cse30 .cse22 .cse2 .cse28 .cse33 .cse10 .cse23 .cse16 .cse34 .cse19 .cse31 .cse20 .cse35) (or .cse0 .cse1 .cse32 .cse29 .cse3 .cse7 .cse8 .cse9 .cse17 .cse18 .cse30 .cse22 .cse2 .cse33 .cse5 .cse10 .cse16 .cse34 .cse19 .cse31 .cse20 .cse35) (or .cse0 .cse1 .cse2 .cse29 .cse3 .cse33 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse22))) [2019-10-02 16:25:30,699 INFO L439 ceAbstractionStarter]: At program point L115(lines 86 121) the Hoare annotation is: (let ((.cse15 (= |old(~t1_pc~0)| 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse50 (not (= 1 ~T2_E~0))) (.cse44 (not (= ~E_2~0 0))) (.cse49 (not .cse0)) (.cse51 (not (= ~E_3~0 0))) (.cse36 (<= 2 ~m_st~0)) (.cse38 (<= 2 ~E_2~0)) (.cse30 (= 1 ~t1_pc~0)) (.cse31 (= ~m_st~0 0)) (.cse47 (<= ~token~0 ~local~0)) (.cse32 (= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (<= 2 ~t3_st~0)) (.cse33 (not (= 0 ~t1_st~0))) (.cse48 (<= ~local~0 ~token~0)) (.cse34 (<= |old(~E_2~0)| ~E_2~0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 ~E_3~0)) (.cse52 (not .cse15)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T3_E~0 1)) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 |old(~t3_st~0)|))) (.cse27 (= 1 ~t3_pc~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse10 (= 1 ~E_1~0)) (.cse21 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 |old(~E_2~0)|))) (.cse23 (= 0 ~E_M~0)) (.cse12 (= |old(~t1_st~0)| 0))) (let ((.cse41 (or .cse0 .cse1 .cse13 .cse52 .cse4 .cse5 .cse26 .cse16 (not .cse27) .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12)) (.cse3 (and .cse30 .cse31 .cse47 .cse32 .cse39 .cse33 .cse48 .cse34)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse37 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse40 (<= (+ ~local~0 1) ~token~0)) (.cse45 (and .cse30 .cse36 .cse38 .cse32 .cse33)) (.cse42 (and .cse30 .cse36 .cse38 .cse32 .cse39 .cse33)) (.cse46 (or .cse0 .cse1 .cse13 .cse52 .cse4 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12)) (.cse25 (and .cse30 .cse36 .cse50 .cse44 .cse39 .cse33 .cse49 .cse51)) (.cse28 (= 0 |old(~E_2~0)|)) (.cse43 (and .cse30 (not .cse19) (not .cse5) (not .cse6) (not (= ~M_E~0 0)) .cse36 (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) .cse49 .cse50 (not .cse9) (not (= ~E_1~0 0)) .cse51 (not .cse8) .cse44 (not (= ~E_M~0 1)))) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse35 (and .cse30 .cse31 .cse47 .cse32 .cse33 .cse48 .cse34)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse24 (= 1 ~m_pc~0)) (.cse29 (not (<= ~t2_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse13 .cse25 .cse5 .cse15 .cse26 .cse16 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse23 .cse28 .cse12) (or .cse0 .cse1 .cse29 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse30 .cse31 .cse32 .cse33 .cse34) .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse35) (or .cse18 (and .cse30 .cse36 .cse37 .cse38 .cse39 .cse33 .cse40) .cse2 .cse14 .cse41 .cse42 .cse43) (or .cse29 .cse41 .cse43) (or .cse0 .cse1 .cse29 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse3 .cse24) (or .cse0 .cse1 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse30 .cse31 .cse32 .cse39 .cse33 .cse34) .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse13 .cse5 .cse15 .cse16 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse20 .cse9 .cse10 (and .cse30 .cse31 .cse44 .cse39 .cse33) .cse21 .cse23 .cse28 .cse12 .cse24) (or .cse0 .cse1 .cse29 .cse13 .cse45 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 .cse43) (or .cse18 .cse2 (and .cse30 .cse36 .cse37 .cse38 .cse33 .cse40) .cse14 .cse46 .cse45 .cse43) (or .cse42 .cse0 .cse1 .cse29 .cse13 .cse5 .cse26 .cse16 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 .cse43) (or .cse29 .cse46 .cse43) (or .cse0 .cse1 .cse13 .cse25 .cse5 .cse26 .cse16 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse23 .cse28 .cse12 .cse43) (or .cse0 .cse1 .cse13 .cse4 (and .cse30 .cse36 .cse32 .cse33 .cse34) .cse5 .cse15 .cse26 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse29 .cse13 .cse5 .cse15 .cse26 .cse27 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 (and .cse32 .cse33 .cse34) .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse15 .cse26 .cse16 .cse6 .cse7 (and .cse30 .cse36 .cse32 .cse39 .cse33 .cse34) .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse13 .cse5 .cse26 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse23 .cse28 .cse43 .cse24) (or .cse0 .cse1 .cse29 .cse2 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse29 .cse13 .cse5 .cse15 .cse26 .cse16 .cse6 .cse7 .cse8 .cse17 .cse19 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 (and .cse32 .cse39 .cse33 .cse34)))))) [2019-10-02 16:25:30,700 INFO L443 ceAbstractionStarter]: For program point transmit1EXIT(lines 86 121) no Hoare annotation was computed. [2019-10-02 16:25:30,700 INFO L439 ceAbstractionStarter]: At program point L111(line 111) the Hoare annotation is: (let ((.cse32 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse34 (<= (+ ~local~0 1) ~token~0)) (.cse2 (= |old(~t2_st~0)| ~t2_st~0)) (.cse33 (<= 2 ~t3_st~0)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (not (<= |old(~token~0)| ~local~0))) (.cse27 (not (<= ~local~0 |old(~token~0)|))) (.cse31 (not (= 1 ~t2_pc~0))) (.cse7 (not (<= ~t2_pc~0 0))) (.cse25 (not (<= 2 |old(~t3_st~0)|))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse30 (= 0 |old(~E_2~0)|)) (.cse0 (= 1 ~t1_pc~0)) (.cse1 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_2~0 0))) (.cse29 (= 1 ~m_pc~0)) (.cse5 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 1)) (.cse8 (= 0 ~E_3~0)) (.cse35 (= 0 |old(~t2_st~0)|)) (.cse9 (= ~T3_E~0 1)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (= 1 ~t3_pc~0)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse16 (= ~T1_E~0 1)) (.cse17 (= 1 ~E_3~0)) (.cse18 (= 1 ~E_1~0)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (not (<= 2 |old(~E_2~0)|))) (.cse22 (= 0 ~E_M~0)) (.cse23 (= |old(~t1_st~0)| 0))) (and (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) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse5 .cse6 .cse7 .cse26 .cse9 .cse12 .cse13 .cse14 .cse17 .cse18 .cse20 .cse23 .cse8 .cse27 .cse24 .cse25 .cse15 .cse16 .cse28 .cse19 .cse21 .cse22 .cse29) (or .cse5 .cse6 .cse8 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse22 .cse30 .cse23 .cse29) (or .cse31 .cse26 .cse27 (and .cse0 .cse1 .cse32 .cse2 .cse3 .cse33 .cse4 .cse34) (or .cse5 .cse6 .cse8 .cse35 .cse9 .cse10 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or .cse5 .cse6 .cse8 .cse9 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse30 .cse29) (or .cse31 .cse26 .cse27 (or .cse5 .cse6 .cse8 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse32 .cse2 .cse3 .cse4 .cse34)) (or .cse5 .cse6 .cse7 .cse26 .cse9 .cse12 .cse11 .cse13 .cse14 .cse17 .cse18 .cse20 .cse23 .cse8 .cse27 .cse24 .cse15 .cse16 .cse28 .cse19 .cse21 .cse22 .cse29) (or .cse5 .cse6 .cse26 .cse35 .cse9 .cse12 .cse13 .cse14 .cse17 .cse18 .cse20 .cse23 .cse8 .cse27 .cse24 .cse25 .cse15 .cse31 .cse16 .cse28 .cse19 .cse21 .cse22 .cse29) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse5 .cse6 .cse7 .cse8 .cse35 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse12 .cse13 .cse14 (and .cse0 .cse1 .cse2 .cse3 .cse33 .cse4) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse5 .cse6 .cse8 .cse35 .cse9 .cse24 .cse10 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse5 .cse6 .cse8 .cse9 .cse24 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse30 .cse23) (or .cse5 .cse6 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse0 .cse1 .cse3 .cse33 .cse4) .cse22 .cse30 .cse23) (or .cse5 .cse6 .cse26 .cse35 .cse9 .cse12 .cse11 .cse13 .cse14 .cse17 .cse18 .cse20 .cse23 .cse8 .cse27 .cse24 .cse15 .cse31 .cse16 .cse28 .cse19 .cse21 .cse22 .cse29) (or .cse5 .cse6 .cse7 .cse35 .cse9 .cse12 .cse13 .cse14 .cse17 .cse18 .cse20 .cse23 .cse8 .cse24 .cse25 .cse15 .cse16 .cse28 .cse19 .cse21 .cse22 .cse29) (or .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse30 (and .cse0 .cse1 .cse3) .cse29) (or .cse5 .cse6 .cse8 .cse35 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) [2019-10-02 16:25:30,700 INFO L443 ceAbstractionStarter]: For program point L111-1(line 111) no Hoare annotation was computed. [2019-10-02 16:25:30,701 INFO L439 ceAbstractionStarter]: At program point L101-1(lines 89 120) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse24 (= |old(~t1_pc~0)| 1)) (.cse12 (= ~T1_E~0 1)) (.cse4 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse50 (not .cse0)) (.cse51 (not (= 1 ~T2_E~0))) (.cse13 (= 1 ~E_3~0)) (.cse52 (not (= ~E_3~0 0))) (.cse10 (= 1 ~M_E~0)) (.cse53 (not (= ~E_2~0 0)))) (let ((.cse6 (not (<= 2 |old(~t3_st~0)|))) (.cse45 (and (not .cse12) (not .cse4) (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) .cse50 .cse51 (not .cse13) (not (= ~E_1~0 0)) .cse52 (not .cse10) .cse53 (not (= ~E_M~0 1)))) (.cse44 (= ~m_st~0 0)) (.cse48 (<= ~token~0 ~local~0)) (.cse49 (<= ~local~0 ~token~0)) (.cse33 (<= |old(~E_2~0)| ~E_2~0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse47 (not .cse24)) (.cse29 (= 0 |old(~t2_st~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (= 1 ~t3_pc~0)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse15 (= 1 ~E_1~0)) (.cse16 (= 0 ~E_1~0)) (.cse22 (not (= 1 ~t1_i~0))) (.cse27 (not (<= 2 |old(~E_2~0)|))) (.cse17 (= 0 ~E_M~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse36 (<= 2 ~t3_st~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (<= 2 ~E_2~0)) (.cse31 (<= 2 ~m_st~0)) (.cse32 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse35 (and .cse36 .cse30 .cse38 .cse31 .cse32)) (.cse43 (and .cse30 .cse38 .cse31 .cse32)) (.cse37 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse39 (<= (+ ~local~0 1) ~token~0)) (.cse41 (or .cse0 .cse1 .cse2 .cse47 .cse29 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19)) (.cse42 (and .cse36 .cse30 .cse31 .cse32 .cse33)) (.cse26 (and .cse36 .cse44 .cse30 .cse48 .cse49 .cse32 .cse33)) (.cse3 (and .cse36 .cse30 .cse31 (and .cse50 .cse51 .cse52 .cse53))) (.cse18 (= 0 |old(~E_2~0)|)) (.cse34 (not (= 1 ~t2_pc~0))) (.cse21 (not (<= |old(~token~0)| ~local~0))) (.cse23 (not (<= ~local~0 |old(~token~0)|))) (.cse46 (and .cse44 .cse30 .cse48 .cse49 .cse32 .cse33)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse28 (= 1 ~m_pc~0)) (.cse14 (and .cse31 .cse45)) (.cse20 (not (<= ~t2_pc~0 0))) (.cse40 (or .cse0 .cse1 .cse2 .cse47 .cse29 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse21 .cse4 .cse8 .cse9 .cse10 .cse13 .cse15 .cse22 .cse19 .cse2 .cse23 .cse24 .cse6 .cse11 .cse12 .cse25 .cse16 .cse26 .cse27 .cse17 .cse28) (or .cse0 .cse1 .cse2 .cse29 .cse4 .cse24 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse30 .cse31 .cse32 .cse33) .cse15 .cse16 .cse22 .cse27 .cse17 .cse19) (or .cse34 .cse14 .cse35 .cse21 (and .cse36 .cse31 .cse37 .cse30 .cse38 .cse39) .cse23 .cse40) (or .cse14 .cse20 .cse41) (or .cse0 .cse1 .cse2 .cse29 .cse42 .cse4 .cse24 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19 .cse43) (or .cse0 .cse1 .cse20 (and .cse44 .cse30 .cse32 .cse33) .cse29 .cse4 .cse7 .cse8 .cse9 .cse10 .cse13 .cse15 .cse22 .cse19 .cse2 .cse24 .cse11 .cse12 .cse25 .cse16 .cse27 .cse17 .cse28) (or .cse0 .cse35 .cse1 .cse20 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse28) (or .cse34 .cse14 .cse43 .cse21 (and .cse31 .cse37 .cse30 .cse38 .cse39) .cse23 .cse41) (or .cse0 .cse1 .cse20 .cse2 .cse4 .cse24 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse42 .cse16 .cse22 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse21 .cse29 .cse4 .cse8 .cse9 .cse10 .cse13 .cse26 .cse15 .cse22 .cse19 .cse2 .cse23 .cse24 .cse6 .cse11 .cse34 .cse12 .cse25 .cse16 .cse27 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse29 .cse4 .cse8 .cse9 .cse10 .cse13 .cse15 .cse22 .cse19 .cse2 .cse24 .cse6 .cse11 .cse12 .cse25 (and .cse36 .cse44 .cse30 .cse32 .cse33) .cse16 .cse27 .cse17 .cse28) (or .cse0 .cse1 .cse2 (and .cse36 .cse30 .cse44 .cse45) .cse4 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 (and .cse30 .cse32 .cse33) .cse4 .cse24 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse21 .cse29 .cse4 .cse46 .cse8 .cse7 .cse9 .cse10 .cse13 .cse15 .cse22 .cse19 .cse2 .cse23 .cse24 .cse11 .cse34 .cse12 .cse25 .cse16 .cse27 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse21 .cse4 .cse8 .cse7 .cse9 .cse10 .cse13 .cse15 .cse22 .cse19 .cse2 .cse23 .cse24 .cse11 .cse46 .cse12 .cse25 .cse16 .cse27 .cse17 .cse28) (or .cse14 .cse20 .cse40)))))) [2019-10-02 16:25:30,702 INFO L439 ceAbstractionStarter]: At program point transmit3ENTRY(lines 158 193) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse39 (= ~m_st~0 0)) (.cse28 (= |old(~t1_st~0)| 0)) (.cse30 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse31 (<= 2 ~m_st~0)) (.cse40 (<= ~token~0 ~local~0)) (.cse32 (= |old(~t2_st~0)| ~t2_st~0)) (.cse33 (= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (= ~E_M~0 |old(~E_M~0)|)) (.cse41 (<= ~local~0 ~token~0))) (let ((.cse38 (and .cse30 .cse31 .cse40 .cse32 .cse33 .cse34 .cse41)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse10 (not .cse28)) (.cse37 (and .cse30 .cse39 .cse32 .cse33 .cse34)) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse15 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse5 (and .cse30 .cse39 .cse40 .cse32 .cse33 .cse34 .cse41)) (.cse24 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse35 (not (<= ~t2_pc~0 0))) (.cse14 (= 0 ~E_3~0)) (.cse27 (not .cse16)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse25 (and .cse30 .cse31 .cse32 .cse33 .cse34)) (.cse4 (= ~T3_E~0 1)) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse7 (= 1 |old(~t3_pc~0)|)) (.cse6 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse19 (= ~T1_E~0 1)) (.cse11 (= 1 ~E_3~0)) (.cse12 (= 1 ~E_1~0)) (.cse21 (= 0 ~E_1~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 ~E_2~0))) (.cse23 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse14 .cse3 .cse25 .cse4 .cse16 .cse26 .cse7 .cse6 .cse8 .cse9 .cse10 .cse17 .cse19 .cse11 .cse12 .cse21 .cse13 .cse22 .cse23) (or .cse0 .cse1 .cse14 .cse27 .cse25 .cse3 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse17 .cse19 .cse11 .cse12 .cse21 .cse13 .cse22 .cse23 .cse28) (let ((.cse29 (+ ~local~0 1))) (or .cse0 .cse1 .cse14 .cse27 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse17 .cse18 .cse19 .cse11 (not (<= .cse29 |old(~token~0)|)) .cse12 .cse21 .cse13 .cse22 (not (<= |old(~token~0)| .cse29)) .cse23 .cse28 (and .cse30 .cse31 (= |old(~token~0)| ~token~0) .cse32 .cse33 .cse34))) (or .cse0 .cse1 .cse35 .cse14 .cse27 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse17 .cse19 .cse11 .cse12 .cse25 .cse21 .cse13 .cse22 .cse23 .cse28) (let ((.cse36 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse6 .cse8 .cse9 (and (= 1 ~t3_pc~0) .cse31 .cse32 (<= ~token~0 .cse36) .cse33 (<= .cse36 ~token~0) .cse34) .cse11 .cse12 .cse13 .cse28 .cse14 (not (<= |old(~token~0)| .cse36)) .cse27 (not .cse7) .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 (not (<= .cse36 |old(~token~0)|)))) (or .cse0 .cse1 .cse35 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse35 .cse3 .cse4 .cse7 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse28 .cse37 .cse14 .cse27 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse35 .cse14 .cse2 .cse27 .cse15 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse10 .cse17 .cse19 .cse11 .cse12 .cse38 .cse21 .cse13 .cse22 .cse23) (or .cse0 .cse1 .cse35 .cse14 .cse25 .cse4 .cse16 .cse26 .cse7 .cse6 .cse8 .cse9 .cse10 .cse17 .cse19 .cse11 .cse12 .cse21 .cse13 .cse22 .cse23) (or (and .cse31 .cse34) .cse0 .cse1 .cse14 .cse4 .cse26 .cse6 .cse8 .cse9 .cse17 .cse19 .cse11 .cse12 .cse21 .cse23 (= 0 ~E_2~0) .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse38 .cse14 .cse27 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse27 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse35 .cse3 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse37 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse35 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse27 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse5 .cse24) (or .cse0 .cse1 .cse35 .cse14 .cse27 .cse3 .cse25 .cse4 .cse26 .cse7 .cse6 .cse8 .cse9 .cse17 .cse19 .cse11 .cse12 .cse21 .cse13 .cse22 .cse23)))) [2019-10-02 16:25:30,702 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-02 16:25:30,702 INFO L439 ceAbstractionStarter]: At program point L166(lines 161 192) the Hoare annotation is: (let ((.cse28 (= |old(~t1_st~0)| 0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse29 (<= 2 ~m_st~0)) (.cse31 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (not (<= ~t2_pc~0 0))) (.cse26 (not .cse5)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (<= |old(~token~0)| ~local~0))) (.cse22 (= 0 |old(~t2_st~0)|)) (.cse4 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse7 (= 1 |old(~t3_pc~0)|)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (not .cse28)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse3 (= 0 ~E_3~0)) (.cse21 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 1 |old(~E_M~0)|)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse13 (= ~T1_E~0 1)) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse16 (= 0 ~E_1~0)) (.cse18 (not (<= 2 ~E_2~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse25 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse21 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25) (let ((.cse27 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse26 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse23 .cse13 .cse14 (not (<= .cse27 |old(~token~0)|)) .cse15 .cse16 .cse17 .cse18 (not (<= |old(~token~0)| .cse27)) .cse19 .cse28)) (or .cse0 .cse1 .cse20 .cse22 .cse4 .cse8 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse28 .cse3 .cse21 .cse26 .cse12 .cse23 .cse13 .cse24 .cse16 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse30 (+ ~local~0 2))) (or .cse0 .cse1 .cse22 .cse4 .cse6 .cse8 .cse9 .cse10 (and (= 1 ~t3_pc~0) .cse29 (= |old(~t2_st~0)| ~t2_st~0) (<= ~token~0 .cse30) (= |old(~t1_st~0)| ~t1_st~0) (<= .cse30 ~token~0) .cse31) .cse14 .cse15 .cse17 .cse28 .cse3 (not (<= |old(~token~0)| .cse30)) .cse26 .cse12 .cse23 .cse13 .cse16 .cse18 .cse19 (not (<= .cse30 |old(~token~0)|)))) (or .cse0 .cse1 .cse3 .cse26 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse8 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse3 .cse21 .cse5 .cse12 .cse13 .cse24 .cse16 .cse18 .cse19 .cse25) (or (and .cse29 .cse31) .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 (= 0 ~E_2~0) .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse22 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse28 .cse25) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse8 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse28 .cse3 .cse21 .cse26 .cse12 .cse13 .cse24 .cse16 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse22 .cse4 .cse8 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse3 .cse21 .cse5 .cse12 .cse23 .cse13 .cse24 .cse16 .cse18 .cse19 .cse25)))) [2019-10-02 16:25:30,703 INFO L439 ceAbstractionStarter]: At program point L187(lines 158 193) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse13 (= |old(~t1_st~0)| 0)) (.cse18 (= ~T1_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse9 (= 1 ~E_3~0)) (.cse8 (= 1 ~M_E~0)) (.cse46 (not (= ~m_pc~0 1))) (.cse47 (not .cse0)) (.cse32 (= ~t1_pc~0 1)) (.cse42 (= ~m_st~0 0)) (.cse22 (= 1 ~t3_pc~0)) (.cse23 (<= 2 ~m_st~0)) (.cse24 (not (= ~E_M~0 0))) (.cse44 (<= ~token~0 ~local~0)) (.cse25 (= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (not (= ~E_M~0 1))) (.cse27 (<= 2 ~t3_st~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~local~0 ~token~0))) (let ((.cse36 (and .cse22 .cse23 .cse24 .cse44 .cse25 .cse26 .cse27 .cse28 .cse45)) (.cse41 (and .cse22 .cse42 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse15 (not .cse32)) (.cse1 (and .cse23 .cse24 .cse46 .cse47 .cse26)) (.cse30 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse29 (not (<= ~t2_pc~0 0))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse34 (and (not (= 1 ~t1_pc~0)) (not .cse18) (not .cse3) (not .cse6) .cse23 (not (= ~M_E~0 0)) .cse24 (not (= ~E_1~0 1)) .cse46 .cse47 (not .cse9) (not (= 1 ~T2_E~0)) (not (= ~E_3~0 0)) (not .cse8) .cse26)) (.cse2 (= ~T2_E~0 1)) (.cse35 (not (<= |old(~token~0)| ~local~0))) (.cse31 (= 0 |old(~t2_st~0)|)) (.cse5 (= 1 |old(~t3_pc~0)|)) (.cse7 (= 0 ~M_E~0)) (.cse33 (not .cse13)) (.cse38 (and .cse22 .cse42 .cse24 .cse44 .cse25 .cse26 .cse27 .cse28 .cse45)) (.cse11 (= 1 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse14 (= 0 ~E_3~0)) (.cse37 (not (<= ~local~0 |old(~token~0)|))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (not (= 1 ~t2_pc~0))) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (<= 2 ~E_2~0))) (.cse21 (= 0 |old(~E_M~0)|)) (.cse40 (= 1 ~m_pc~0))) (and (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (<= |old(~token~0)| .cse10)) .cse21 (and .cse22 .cse23 .cse24 (= |old(~token~0)| ~token~0) .cse25 .cse26 .cse27 .cse28))) (or .cse0 .cse1 .cse2 .cse29 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse18 .cse9 .cse11 .cse19 .cse12 .cse20 .cse21 .cse30 .cse13) (or .cse0 .cse2 .cse14 .cse31 .cse3 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse16 .cse18 .cse9 .cse11 .cse34 .cse19 .cse12 .cse20 .cse30 .cse21) (or .cse0 .cse1 .cse2 .cse35 .cse31 .cse3 .cse4 .cse36 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse11 .cse12 .cse14 .cse15 .cse37 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse29 .cse35 .cse3 .cse6 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse37 .cse15 .cse38 .cse16 .cse18 .cse39 .cse19 .cse20 .cse21 .cse40) (or .cse0 .cse2 .cse29 .cse31 .cse3 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse11 .cse12 .cse14 .cse32 .cse16 .cse18 .cse39 .cse19 .cse20 .cse21 .cse41 .cse40) (or .cse0 .cse1 .cse2 .cse14 .cse15 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse18 .cse9 .cse11 .cse19 .cse12 .cse20 .cse21 .cse13 .cse30) (or .cse0 .cse2 .cse35 .cse31 .cse3 .cse6 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse38 .cse14 .cse37 .cse15 .cse16 .cse17 .cse18 .cse39 .cse19 .cse20 .cse21 .cse40) (or .cse36 .cse0 .cse1 .cse2 .cse29 .cse35 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse11 .cse12 .cse14 .cse15 .cse37 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse41 .cse0 .cse2 .cse29 .cse31 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse39 .cse19 .cse20 .cse21 .cse40) (or .cse0 .cse1 .cse2 .cse29 .cse14 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse16 .cse30 .cse18 .cse9 .cse11 .cse19 .cse12 .cse20 .cse21) (let ((.cse43 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse31 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 (and .cse22 .cse42 .cse24 .cse25 .cse26 .cse27 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse28) .cse12 .cse13 .cse14 (not (<= |old(~token~0)| .cse43)) .cse15 .cse16 .cse17 .cse18 .cse30 .cse19 .cse20 .cse21 (not (<= .cse43 |old(~token~0)|)))) (or .cse0 .cse2 .cse29 .cse35 .cse3 .cse6 .cse5 .cse7 .cse8 .cse33 .cse9 .cse11 .cse12 .cse14 .cse37 .cse32 .cse16 .cse18 .cse39 .cse19 .cse38 .cse20 .cse21 .cse40) (or .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16 .cse18 .cse9 .cse11 .cse19 .cse21 (= 0 ~E_2~0) .cse40) (or .cse30 .cse0 .cse2 .cse29 .cse14 .cse3 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse16 .cse18 .cse9 .cse11 .cse34 .cse19 .cse12 .cse20 .cse21) (or .cse0 .cse2 .cse35 .cse31 .cse3 .cse6 .cse5 .cse7 .cse8 .cse33 .cse38 .cse9 .cse11 .cse12 .cse14 .cse37 .cse32 .cse16 .cse17 .cse18 .cse39 .cse19 .cse20 .cse21 .cse40))))) [2019-10-02 16:25:30,704 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (let ((.cse30 (= |old(~t1_st~0)| 0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse24 (<= 2 ~m_st~0)) (.cse25 (not (= ~E_M~0 0))) (.cse2 (not (<= ~t2_pc~0 0))) (.cse28 (not .cse5)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (<= |old(~token~0)| ~local~0))) (.cse22 (= 0 |old(~t2_st~0)|)) (.cse4 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse7 (= 1 |old(~t3_pc~0)|)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (not .cse30)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse3 (= 0 ~E_3~0)) (.cse21 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 1 |old(~E_M~0)|)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse13 (= ~T1_E~0 1)) (.cse27 (not (= 0 |old(~m_st~0)|))) (.cse16 (= 0 ~E_1~0)) (.cse18 (not (<= 2 ~E_2~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse26 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse20 .cse21 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 (and .cse24 .cse25) .cse16 .cse19 (= 0 ~E_2~0) .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26) (let ((.cse29 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse28 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse23 .cse13 .cse14 (not (<= .cse29 |old(~token~0)|)) .cse15 .cse16 .cse17 .cse18 (not (<= |old(~token~0)| .cse29)) .cse19 .cse30)) (or .cse0 .cse1 .cse20 .cse22 .cse4 .cse8 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse30 .cse3 .cse21 .cse28 .cse12 .cse23 .cse13 .cse27 .cse16 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse31 (+ ~local~0 2))) (or .cse0 .cse1 .cse22 .cse4 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 (and (= 1 ~t3_pc~0) .cse24 .cse25 (= |old(~t2_st~0)| ~t2_st~0) (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) (= |old(~t1_st~0)| ~t1_st~0)) .cse17 .cse30 .cse3 (not (<= |old(~token~0)| .cse31)) .cse28 .cse12 .cse23 .cse13 .cse16 .cse18 .cse19 (not (<= .cse31 |old(~token~0)|)))) (or .cse0 .cse1 .cse3 .cse28 .cse22 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse8 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse3 .cse21 .cse5 .cse12 .cse13 .cse27 .cse16 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse22 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse26) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse8 .cse7 .cse9 .cse10 .cse14 .cse15 .cse17 .cse30 .cse3 .cse21 .cse28 .cse12 .cse13 .cse27 .cse16 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30) (or .cse0 .cse1 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse22 .cse4 .cse8 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse3 .cse21 .cse5 .cse12 .cse23 .cse13 .cse27 .cse16 .cse18 .cse19 .cse26)))) [2019-10-02 16:25:30,704 INFO L443 ceAbstractionStarter]: For program point L183-1(line 183) no Hoare annotation was computed. [2019-10-02 16:25:30,704 INFO L443 ceAbstractionStarter]: For program point transmit3EXIT(lines 158 193) no Hoare annotation was computed. [2019-10-02 16:25:30,705 INFO L439 ceAbstractionStarter]: At program point L173-1(lines 161 192) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse30 (= |old(~t1_st~0)| 0)) (.cse25 (= ~t1_pc~0 1)) (.cse43 (= ~m_st~0 0)) (.cse20 (= ~T1_E~0 1)) (.cse5 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse46 (not (= ~m_pc~0 1))) (.cse47 (not .cse0)) (.cse12 (= 1 ~E_3~0)) (.cse10 (= 1 ~M_E~0)) (.cse31 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (not (= ~E_M~0 0))) (.cse44 (<= ~token~0 ~local~0)) (.cse34 (= |old(~t2_st~0)| ~t2_st~0)) (.cse35 (not (= ~E_M~0 1))) (.cse36 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~local~0 ~token~0))) (let ((.cse14 (and .cse31 .cse32 .cse33 .cse44 .cse34 .cse35 .cse36 .cse45)) (.cse40 (and (not (= 1 ~t1_pc~0)) (not .cse20) (not .cse5) (not .cse8) .cse32 (not (= ~M_E~0 0)) .cse33 (not (= ~E_1~0 1)) .cse46 .cse47 (not .cse12) (not (= 1 ~T2_E~0)) (not (= ~E_3~0 0)) (not .cse10) .cse35)) (.cse39 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)) (.cse27 (and .cse31 .cse43 .cse33 .cse34 .cse35 .cse36)) (.cse1 (and .cse32 .cse33 .cse46 .cse47 .cse35)) (.cse24 (= 0 |old(~t2_st~0)|)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not .cse25)) (.cse37 (not (= 1 ~t2_pc~0))) (.cse2 (= ~T2_E~0 1)) (.cse3 (not (<= ~t2_pc~0 0))) (.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse7 (= 1 |old(~t3_pc~0)|)) (.cse9 (= 0 ~M_E~0)) (.cse11 (not .cse30)) (.cse13 (= 1 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (= 0 ~E_3~0)) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse19 (= 1 |old(~E_M~0)|)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse21 (= 0 ~E_1~0)) (.cse22 (not (<= 2 ~E_2~0))) (.cse23 (= 0 |old(~E_M~0)|)) (.cse38 (and .cse31 .cse43 .cse33 .cse44 .cse34 .cse35 .cse36 .cse45)) (.cse28 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse24 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse25 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse27 .cse28) (let ((.cse29 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (<= .cse29 |old(~token~0)|)) .cse13 .cse15 .cse30 .cse16 .cse17 (and .cse31 .cse32 .cse33 (= |old(~token~0)| ~token~0) .cse34 .cse35 .cse36) .cse19 .cse37 .cse20 .cse21 .cse22 (not (<= |old(~token~0)| .cse29)) .cse23)) (or .cse0 .cse2 .cse4 .cse24 .cse5 .cse8 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse30 .cse38 .cse16 .cse18 .cse17 .cse19 .cse37 .cse20 .cse26 .cse21 .cse22 .cse23 .cse28) (or .cse0 .cse1 .cse2 .cse16 .cse17 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse39 .cse21 .cse15 .cse22 .cse23 .cse30) (or .cse0 .cse2 .cse4 .cse24 .cse5 .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse25 .cse38 .cse19 .cse37 .cse20 .cse26 .cse21 .cse22 .cse23 .cse28) (or .cse0 .cse2 .cse16 .cse39 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse40 .cse21 .cse15 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse14 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse37 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse16 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse40 .cse21 .cse15 .cse22 .cse23 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse39 .cse21 .cse15 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse20 .cse39 .cse12 .cse13 .cse21 .cse15 .cse22 .cse23 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse9 .cse10 .cse38 .cse12 .cse13 .cse15 .cse30 .cse16 .cse18 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse28) (or .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse19 .cse20 .cse12 .cse13 .cse21 .cse23 (= 0 ~E_2~0) .cse28) (or .cse0 .cse2 .cse3 .cse24 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse28) (let ((.cse41 (= 1 ~t3_pc~0)) (.cse42 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse24 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse30 (and .cse41 .cse32 .cse33 .cse34 .cse35 .cse36) .cse16 (not (<= |old(~token~0)| .cse42)) .cse17 (not .cse7) .cse19 .cse37 .cse20 (and .cse41 .cse43 .cse33 .cse34 .cse35 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse36) .cse21 .cse22 .cse23 (not (<= .cse42 |old(~token~0)|)))) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse25 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse38 .cse28))))) [2019-10-02 16:25:30,705 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2019-10-02 16:25:30,706 INFO L439 ceAbstractionStarter]: At program point L151(lines 122 157) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse9 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse3 (= ~T3_E~0 1)) (.cse12 (= ~T1_E~0 1))) (let ((.cse49 (= 1 ~t1_pc~0)) (.cse50 (not .cse12)) (.cse51 (not .cse3)) (.cse52 (not .cse7)) (.cse53 (not (= ~M_E~0 0))) (.cse54 (not (= ~E_M~0 0))) (.cse55 (not (= ~E_1~0 1))) (.cse56 (not (= ~m_pc~0 1))) (.cse57 (not .cse0)) (.cse58 (not (= 1 ~T2_E~0))) (.cse59 (not (= ~E_1~0 0))) (.cse60 (not .cse9)) (.cse61 (not (= ~E_2~0 0))) (.cse62 (not (= ~E_M~0 1))) (.cse35 (<= 2 ~m_st~0)) (.cse42 (<= ~token~0 ~local~0)) (.cse38 (= 1 ~t2_pc~0)) (.cse39 (not (= 0 ~t2_st~0))) (.cse44 (<= ~local~0 ~token~0)) (.cse63 (= ~m_st~0 0)) (.cse36 (not (= 1 ~E_3~0))) (.cse43 (<= 2 ~t3_st~0)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (not (= ~E_3~0 0))) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse45 (not .cse4)) (.cse23 (= 0 |old(~t2_st~0)|)) (.cse32 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 |old(~t3_st~0)|))) (.cse6 (= 1 ~t3_pc~0)) (.cse8 (= 0 ~M_E~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (= 1 |old(~E_3~0)|)) (.cse15 (= 1 ~E_1~0)) (.cse16 (= 0 ~E_1~0)) (.cse25 (not (= 1 ~t1_i~0))) (.cse27 (not (<= 2 ~E_2~0))) (.cse17 (= 0 ~E_M~0)) (.cse46 (= |old(~t1_st~0)| 0))) (let ((.cse29 (or .cse0 .cse1 .cse2 .cse45 .cse23 .cse3 .cse32 .cse5 (not .cse6) .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse27 .cse17 .cse46)) (.cse10 (and .cse63 .cse36 .cse43 .cse40 .cse41)) (.cse48 (and .cse63 .cse36 .cse42 .cse38 .cse43 .cse39 .cse40 .cse41 .cse44)) (.cse47 (and .cse35 .cse36 .cse38 .cse39 .cse40 .cse41)) (.cse28 (and .cse35 .cse36 .cse38 .cse43 .cse39 .cse40 .cse41)) (.cse33 (and .cse35 .cse36 .cse43 .cse40 .cse41)) (.cse13 (not (= 0 |old(~m_st~0)|))) (.cse20 (and .cse63 .cse36 .cse42 .cse38 .cse39 .cse40 .cse41 .cse44)) (.cse21 (not (<= |old(~t2_pc~0)| 0))) (.cse22 (not (<= |old(~token~0)| ~local~0))) (.cse24 (not .cse46)) (.cse30 (and .cse49 .cse50 .cse51 .cse52 .cse35 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse36 .cse41 .cse59 .cse60 .cse61 .cse62)) (.cse26 (not (<= ~local~0 |old(~token~0)|))) (.cse31 (and (not .cse49) .cse50 .cse51 .cse52 .cse35 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse36 .cse41 .cse59 .cse60 .cse61 .cse62)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse22 .cse23 .cse3 .cse7 .cse6 .cse8 .cse9 .cse24 .cse14 .cse15 .cse25 .cse2 .cse26 .cse4 .cse11 .cse12 .cse13 .cse16 .cse27 .cse17 .cse19) (or .cse21 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse31 .cse3 .cse4 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse33 .cse17 .cse18) (let ((.cse34 (+ ~local~0 1))) (or (not (= 1 |old(~t2_pc~0)|)) (not (<= .cse34 |old(~token~0)|)) .cse28 (not (<= |old(~token~0)| .cse34)) (let ((.cse37 (+ ~local~0 2))) (and .cse35 .cse36 (<= ~token~0 .cse37) .cse38 .cse39 .cse40 .cse41 (<= .cse37 ~token~0))) .cse29 .cse30)) (or .cse0 .cse1 .cse21 .cse22 (and .cse35 .cse36 .cse42 .cse38 .cse43 .cse39 .cse40 .cse41 .cse44) .cse23 .cse3 .cse32 .cse7 .cse8 .cse9 .cse24 .cse30 .cse14 .cse15 .cse25 .cse2 .cse26 .cse45 .cse5 .cse11 .cse12 .cse16 .cse27 .cse17) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse46 .cse19) (or .cse0 .cse1 .cse2 .cse45 .cse23 .cse3 .cse32 .cse6 .cse7 .cse8 .cse30 .cse9 .cse11 .cse47 .cse12 .cse14 .cse15 .cse16 .cse25 .cse27 .cse17 .cse46) (or .cse0 .cse1 .cse21 .cse22 .cse23 .cse3 .cse7 .cse8 .cse9 .cse24 .cse14 .cse15 .cse25 .cse2 .cse26 .cse4 .cse5 .cse11 .cse12 .cse13 .cse48 .cse16 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse21 .cse22 .cse23 .cse3 .cse7 .cse8 .cse9 .cse14 .cse15 .cse25 .cse46 .cse2 .cse26 .cse45 .cse5 .cse11 .cse12 .cse13 .cse16 .cse48 .cse27 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse31 .cse3 .cse4 .cse32 .cse6 .cse7 .cse8 .cse9 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse27 .cse17 .cse47) (or .cse28 .cse21 (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse32 .cse5 .cse7 .cse8 .cse9 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse27 .cse17) .cse31) (or .cse0 .cse1 .cse2 .cse33 .cse45 .cse3 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse45 .cse3 .cse32 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse21 .cse22 .cse23 .cse3 .cse7 .cse6 .cse8 .cse9 .cse14 .cse15 .cse25 .cse46 .cse2 .cse26 .cse45 .cse11 .cse12 .cse13 .cse16 .cse27 .cse17 .cse20 .cse19) (or .cse0 .cse1 .cse21 .cse22 .cse23 .cse3 .cse32 .cse6 .cse7 .cse8 .cse9 .cse24 .cse30 .cse14 (and .cse35 .cse36 .cse42 .cse38 .cse39 .cse40 .cse41 .cse44) .cse15 .cse25 .cse2 .cse45 .cse26 .cse11 .cse12 .cse16 .cse27 .cse17) (or .cse0 .cse1 .cse2 .cse31 .cse3 .cse4 .cse32 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))))) [2019-10-02 16:25:30,707 INFO L439 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (let ((.cse24 (= 1 ~t3_pc~0)) (.cse23 (= ~t1_pc~0 1))) (let ((.cse30 (<= 2 ~m_st~0)) (.cse37 (= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= 1 ~t2_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 |old(~E_3~0)|)) (.cse15 (not .cse23)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T3_E~0 1)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 |old(~t3_st~0)|))) (.cse16 (not .cse24)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse10 (= 1 |old(~E_3~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse20 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse21 (not (<= 2 ~E_2~0))) (.cse22 (= 0 ~E_M~0)) (.cse29 (= |old(~t1_st~0)| 0)) (.cse32 (<= 2 ~t3_st~0)) (.cse33 (= |old(~t1_st~0)| ~t1_st~0)) (.cse31 (not (= ~E_3~0 0)))) (let ((.cse25 (and (= ~m_st~0 0) .cse32 .cse33 .cse31)) (.cse27 (= 0 ~E_2~0)) (.cse35 (or .cse0 .cse1 .cse13 .cse15 .cse4 .cse5 .cse6 .cse17 .cse16 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22 .cse29)) (.cse40 (and .cse30 .cse37 .cse39 (not .cse0) .cse33 .cse31)) (.cse34 (not .cse29)) (.cse2 (not (<= |old(~t2_pc~0)| 0))) (.cse3 (not (<= |old(~token~0)| ~local~0))) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse28 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse5 .cse23 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse25 .cse19 .cse26 .cse10 .cse11 .cse20 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse13 .cse5 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse26 .cse10 .cse11 .cse20 .cse22 .cse27 .cse29 .cse28 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 (and .cse30 .cse31) .cse22 .cse27 .cse28) (or (and .cse30 .cse32 .cse33 .cse31) .cse0 .cse1 .cse13 .cse5 .cse6 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse22 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse17 .cse18 .cse19 .cse26 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse18 .cse19 .cse26 .cse20 .cse21 .cse22 .cse28) (or .cse2 .cse35) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse15 .cse14 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse34 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22) (or .cse2 (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse23 .cse6 .cse17 .cse16 .cse7 .cse8 .cse9 .cse34 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22)) (let ((.cse36 (+ ~local~0 1))) (or (not (= 1 |old(~t2_pc~0)|)) (not (<= .cse36 |old(~token~0)|)) (not (<= |old(~token~0)| .cse36)) .cse35 (let ((.cse38 (+ ~local~0 2))) (and .cse30 .cse37 (<= ~token~0 .cse38) .cse39 .cse32 .cse33 .cse31 (<= .cse38 ~token~0))))) (or .cse0 .cse40 .cse1 .cse13 .cse15 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22 .cse29) (or .cse0 .cse40 .cse1 .cse13 .cse4 .cse5 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse34 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse18 .cse19 .cse26 .cse20 .cse21 .cse22 .cse28))))) [2019-10-02 16:25:30,707 INFO L443 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2019-10-02 16:25:30,707 INFO L443 ceAbstractionStarter]: For program point transmit2EXIT(lines 122 157) no Hoare annotation was computed. [2019-10-02 16:25:30,708 INFO L439 ceAbstractionStarter]: At program point L137-1(lines 125 156) the Hoare annotation is: (let ((.cse63 (<= 2 ~E_2~0)) (.cse8 (= ~t1_pc~0 1)) (.cse4 (= ~T1_E~0 0)) (.cse7 (= ~T3_E~0 1)) (.cse16 (= ~T1_E~0 1)) (.cse13 (= 1 ~M_E~0)) (.cse11 (= ~T2_E~0 0))) (let ((.cse56 (not (= ~m_pc~0 1))) (.cse61 (not (= ~E_2~0 0))) (.cse43 (<= ~t2_pc~0 0)) (.cse44 (<= ~token~0 ~local~0)) (.cse46 (<= ~local~0 ~token~0)) (.cse48 (= ~m_st~0 0)) (.cse49 (= 1 ~t1_pc~0)) (.cse52 (not .cse11)) (.cse25 (<= 2 ~m_st~0)) (.cse53 (not (= ~M_E~0 0))) (.cse54 (not (= ~E_M~0 0))) (.cse58 (not (= 1 ~T2_E~0))) (.cse26 (not (= 1 ~E_3~0))) (.cse60 (not .cse13)) (.cse27 (= |old(~t2_st~0)| ~t2_st~0)) (.cse62 (not (= ~E_M~0 1))) (.cse50 (not .cse16)) (.cse51 (not .cse7)) (.cse45 (<= 2 ~t3_st~0)) (.cse55 (not (= ~E_1~0 1))) (.cse57 (not .cse4)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (not (= ~E_3~0 0))) (.cse59 (not (= ~E_1~0 0))) (.cse5 (= ~T2_E~0 1)) (.cse6 (= 0 |old(~E_3~0)|)) (.cse31 (not .cse8)) (.cse32 (= 0 |old(~t2_st~0)|)) (.cse33 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (<= 2 |old(~t3_st~0)|))) (.cse10 (= 1 ~t3_pc~0)) (.cse12 (= 0 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse18 (= 1 |old(~E_3~0)|)) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 0 ~E_1~0)) (.cse34 (not (= 1 ~t1_i~0))) (.cse35 (not .cse63)) (.cse21 (= 0 ~E_M~0)) (.cse36 (= |old(~t1_st~0)| 0))) (let ((.cse1 (or .cse4 .cse5 .cse6 .cse31 .cse32 .cse7 .cse33 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse34 .cse35 .cse21 .cse36)) (.cse2 (and .cse49 .cse52 .cse25 .cse53 .cse54 .cse10 .cse58 .cse26 .cse63 .cse60 .cse27 .cse62 .cse50 .cse51 .cse45 (not (= 0 ~t1_st~0)) (= ~t1_i~0 1) .cse55 (not (= 0 ~t2_st~0)) .cse57 .cse29 .cse30 .cse59)) (.cse14 (and .cse48 .cse26 .cse45 .cse29 .cse30)) (.cse42 (and .cse48 .cse43 .cse26 .cse44 .cse27 .cse45 .cse29 .cse30 .cse46)) (.cse38 (and .cse25 .cse26 .cse45 .cse29 .cse30)) (.cse3 (and .cse49 .cse50 .cse51 .cse52 .cse25 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse26 .cse30 .cse59 .cse60 .cse61 .cse62)) (.cse37 (and (not .cse49) .cse50 .cse51 .cse52 .cse25 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse26 .cse30 .cse59 .cse60 .cse61 .cse62)) (.cse22 (= 0 ~E_2~0)) (.cse0 (not (<= |old(~t2_pc~0)| 0))) (.cse40 (not (<= |old(~token~0)| ~local~0))) (.cse39 (not .cse36)) (.cse47 (and .cse48 .cse43 .cse26 .cse44 .cse27 .cse29 .cse30 .cse46)) (.cse41 (not (<= ~local~0 |old(~token~0)|))) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse23 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse24 (+ ~local~0 1))) (or (not (= 1 |old(~t2_pc~0)|)) (not (<= .cse24 |old(~token~0)|)) (let ((.cse28 (+ ~local~0 2))) (and .cse25 .cse26 .cse27 (<= ~token~0 .cse28) (= 1 ~t2_pc~0) .cse29 .cse30 (<= .cse28 ~token~0))) (not (<= |old(~token~0)| .cse24)) .cse1 .cse2 .cse3)) (or .cse4 .cse5 .cse6 .cse31 .cse32 .cse7 .cse33 .cse10 .cse11 .cse12 .cse3 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse34 .cse35 (and (and .cse25 .cse26 .cse29 .cse30) .cse27) .cse21 .cse36) (or .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse38 .cse21 .cse22) (or .cse4 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23) (or .cse4 .cse5 .cse6 .cse32 .cse37 .cse7 .cse8 .cse33 .cse10 .cse11 .cse12 .cse13 .cse39 .cse15 .cse16 .cse18 .cse19 (and .cse25 .cse26 .cse27 .cse29 .cse30) .cse20 .cse34 .cse35 .cse21) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse11 .cse12 .cse13 .cse18 .cse19 .cse34 .cse36 .cse6 .cse41 .cse31 .cse9 .cse15 .cse16 .cse17 .cse20 .cse35 .cse21 .cse42 .cse23) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse42 .cse11 .cse12 .cse13 .cse39 .cse18 .cse19 .cse34 .cse6 .cse41 .cse8 .cse9 .cse15 .cse16 .cse17 .cse20 .cse35 .cse21 .cse23) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse33 .cse11 .cse12 .cse13 .cse39 .cse3 .cse18 .cse19 .cse34 .cse6 .cse41 .cse31 .cse9 .cse15 .cse16 (and .cse25 .cse43 .cse26 .cse44 .cse27 .cse45 .cse29 .cse30 .cse46) .cse20 .cse35 .cse21) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse33 .cse10 .cse11 .cse12 .cse13 .cse39 .cse3 .cse18 .cse19 .cse34 .cse6 .cse31 .cse41 .cse15 .cse16 .cse20 .cse35 (and .cse25 .cse43 .cse26 .cse44 .cse27 .cse29 .cse30 .cse46) .cse21) (or .cse4 .cse5 .cse6 .cse38 .cse31 .cse7 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (or (and .cse25 .cse26 .cse27 .cse45 .cse29 .cse30) .cse0 (or .cse4 .cse5 .cse6 .cse32 .cse7 .cse8 .cse33 .cse9 .cse11 .cse12 .cse13 .cse39 .cse15 .cse16 .cse18 .cse19 .cse20 .cse34 .cse35 .cse21) .cse37) (or .cse4 .cse5 .cse6 .cse31 .cse7 .cse33 .cse11 .cse12 .cse13 .cse3 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse33 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse11 .cse10 .cse12 .cse13 .cse18 .cse19 .cse34 .cse36 .cse6 .cse41 .cse31 .cse47 .cse15 .cse16 .cse17 .cse20 .cse35 .cse21 .cse23) (or .cse4 .cse5 .cse0 .cse40 .cse32 .cse7 .cse11 .cse10 .cse12 .cse13 .cse39 .cse18 .cse19 .cse34 .cse47 .cse6 .cse41 .cse8 .cse15 .cse16 .cse17 .cse20 .cse35 .cse21 .cse23))))) [2019-10-02 16:25:30,708 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 133) no Hoare annotation was computed. [2019-10-02 16:25:30,709 INFO L439 ceAbstractionStarter]: At program point transmit2ENTRY(lines 122 157) the Hoare annotation is: (let ((.cse26 (= 1 ~t3_pc~0)) (.cse25 (= ~t1_pc~0 1))) (let ((.cse30 (<= 2 ~m_st~0)) (.cse34 (<= 2 ~t3_st~0)) (.cse47 (= ~m_st~0 0)) (.cse43 (<= ~t2_pc~0 0)) (.cse31 (= ~E_3~0 |old(~E_3~0)|)) (.cse44 (<= ~token~0 ~local~0)) (.cse32 (= |old(~t2_st~0)| ~t2_st~0)) (.cse35 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (<= ~local~0 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse14 (= 0 |old(~E_3~0)|)) (.cse16 (not .cse25)) (.cse5 (= 0 |old(~t2_st~0)|)) (.cse6 (= ~T3_E~0 1)) (.cse38 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 |old(~t3_st~0)|))) (.cse46 (not .cse26)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse10 (= 1 |old(~E_3~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse21 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 ~E_2~0))) (.cse23 (= 0 ~E_M~0)) (.cse13 (= |old(~t1_st~0)| 0))) (let ((.cse37 (or .cse0 .cse1 .cse14 .cse16 .cse5 .cse6 .cse38 .cse17 .cse46 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23 .cse13)) (.cse40 (and .cse47 .cse43 .cse31 .cse44 .cse32 .cse35 .cse45)) (.cse33 (= 1 ~t2_pc~0)) (.cse29 (not (= 1 |old(~t2_pc~0)|))) (.cse3 (and .cse47 .cse43 .cse31 .cse44 .cse32 .cse34 .cse35 .cse45)) (.cse41 (and .cse30 .cse43 .cse31 .cse32 .cse34 .cse35)) (.cse28 (and .cse47 .cse31 .cse34 .cse35)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse27 (= 0 ~E_2~0)) (.cse24 (= 1 ~m_pc~0)) (.cse42 (and .cse30 .cse31 .cse32 .cse35)) (.cse2 (not (<= |old(~t2_pc~0)| 0))) (.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse39 (not .cse13)) (.cse15 (not (<= ~local~0 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse14 .cse6 .cse25 .cse17 .cse26 .cse7 .cse8 .cse9 .cse18 .cse19 .cse20 .cse10 .cse11 .cse21 .cse23 .cse27 .cse24 .cse28) (let ((.cse36 (+ ~local~0 1))) (or .cse29 (and .cse30 (= |old(~token~0)| ~token~0) .cse31 .cse32 .cse33 .cse34 .cse35) (not (<= .cse36 |old(~token~0)|)) (not (<= |old(~token~0)| .cse36)) .cse37)) (or .cse0 .cse1 .cse14 .cse6 .cse38 .cse17 .cse26 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 (and .cse30 .cse31 .cse34 .cse35) .cse21 .cse23 .cse27) (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse25 .cse38 .cse26 .cse7 .cse8 .cse9 .cse39 .cse18 .cse29 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse40 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse41 .cse2 .cse37) (or (and .cse30 .cse31) .cse0 .cse1 .cse14 .cse6 .cse38 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse21 .cse23 .cse27 .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse39 .cse10 .cse11 .cse40 .cse12 .cse14 .cse15 .cse25 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse14 .cse5 .cse42 .cse6 .cse25 .cse38 .cse26 .cse7 .cse8 .cse9 .cse39 .cse18 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23) (or .cse0 .cse33 .cse1 .cse14 .cse16 .cse5 .cse6 .cse38 .cse26 .cse7 .cse8 .cse9 .cse18 .cse29 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23 .cse13) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse39 .cse10 .cse11 .cse12 .cse3 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse38 (and .cse30 .cse43 .cse31 .cse44 .cse32 .cse35 .cse45) .cse26 .cse7 .cse8 .cse9 .cse39 .cse10 .cse11 .cse12 .cse14 .cse16 .cse15 .cse18 .cse19 .cse21 .cse22 .cse23) (or .cse41 .cse2 (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse25 .cse38 .cse17 .cse46 .cse7 .cse8 .cse9 .cse39 .cse18 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23)) (or .cse0 .cse28 .cse1 .cse14 .cse6 .cse17 .cse26 .cse7 .cse8 .cse9 .cse18 .cse19 .cse20 .cse10 .cse11 .cse21 .cse23 .cse27 .cse13 .cse24) (or .cse0 .cse1 .cse14 .cse16 .cse42 .cse5 .cse6 .cse38 .cse26 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse21 .cse12 .cse22 .cse23 .cse13) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse38 .cse7 .cse8 .cse9 .cse39 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse30 .cse43 .cse31 .cse44 .cse32 .cse34 .cse35 .cse45) .cse21 .cse22 .cse23))))) [2019-10-02 16:25:30,709 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-02 16:25:30,709 INFO L439 ceAbstractionStarter]: At program point L130(lines 125 156) the Hoare annotation is: (let ((.cse24 (= 1 ~t3_pc~0)) (.cse23 (= ~t1_pc~0 1))) (let ((.cse29 (<= 2 ~m_st~0)) (.cse31 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= 1 ~t2_pc~0)) (.cse30 (= ~E_3~0 |old(~E_3~0)|)) (.cse33 (<= 2 ~t3_st~0)) (.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 |old(~E_3~0)|)) (.cse15 (not .cse23)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (= ~T3_E~0 1)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 |old(~t3_st~0)|))) (.cse16 (not .cse24)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse18 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse10 (= 1 |old(~E_3~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse20 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse21 (not (<= 2 ~E_2~0))) (.cse22 (= 0 ~E_M~0)) (.cse37 (= |old(~t1_st~0)| 0))) (let ((.cse36 (or .cse0 .cse1 .cse13 .cse15 .cse4 .cse5 .cse6 .cse17 .cse16 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22 .cse37)) (.cse28 (and (= ~m_st~0 0) .cse30 .cse33 .cse34)) (.cse26 (= 0 ~E_2~0)) (.cse38 (not .cse37)) (.cse39 (and .cse29 .cse30 .cse31 .cse32 .cse34)) (.cse2 (not (<= |old(~t2_pc~0)| 0))) (.cse3 (not (<= |old(~token~0)| ~local~0))) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse27 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse5 .cse23 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse25 .cse10 .cse11 .cse20 .cse22 .cse26 .cse27 .cse28) (let ((.cse35 (+ ~local~0 1))) (or (not (= 1 |old(~t2_pc~0)|)) (and .cse29 (= |old(~token~0)| ~token~0) .cse30 .cse31 .cse32 .cse33 .cse34) (not (<= .cse35 |old(~token~0)|)) (not (<= |old(~token~0)| .cse35)) .cse36)) (or .cse0 .cse1 .cse13 .cse5 .cse6 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 (and .cse29 .cse30 .cse33 .cse34) .cse20 .cse22 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse22 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse38 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse22 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse38 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse18 .cse19 .cse25 .cse20 .cse21 .cse22 .cse27) (or (and .cse29 .cse30) .cse0 .cse1 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse22 .cse26 .cse27) (or .cse2 .cse36) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse15 .cse14 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse38 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22) (or .cse2 (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse23 .cse6 .cse17 .cse16 .cse7 .cse8 .cse9 .cse38 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22)) (or .cse0 .cse28 .cse1 .cse13 .cse5 .cse17 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse25 .cse10 .cse11 .cse20 .cse22 .cse26 .cse37 .cse27) (or .cse0 .cse39 .cse1 .cse13 .cse15 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22 .cse37) (or .cse0 .cse1 .cse13 .cse4 .cse5 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse38 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse22 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse13 .cse14 .cse15 .cse18 .cse19 .cse25 .cse20 .cse21 .cse22 .cse27))))) [2019-10-02 16:25:30,710 INFO L443 ceAbstractionStarter]: For program point L718(line 718) no Hoare annotation was computed. [2019-10-02 16:25:30,710 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 712 723) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (and (= |old(~t3_pc~0)| ~t3_pc~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,710 INFO L439 ceAbstractionStarter]: At program point L717(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (and (= |old(~t3_pc~0)| ~t3_pc~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,710 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 712 723) no Hoare annotation was computed. [2019-10-02 16:25:30,711 INFO L439 ceAbstractionStarter]: At program point L717-1(line 717) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (= |old(~t3_pc~0)| ~t3_pc~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= ~t1_i~0 1) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,711 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 712 723) no Hoare annotation was computed. [2019-10-02 16:25:30,711 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:25:30,711 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-02 16:25:30,711 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-10-02 16:25:30,711 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:25:30,711 INFO L446 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: true [2019-10-02 16:25:30,712 INFO L443 ceAbstractionStarter]: For program point L640-1(line 640) no Hoare annotation was computed. [2019-10-02 16:25:30,712 INFO L446 ceAbstractionStarter]: At program point L649(lines 638 651) the Hoare annotation is: true [2019-10-02 16:25:30,712 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 634 652) no Hoare annotation was computed. [2019-10-02 16:25:30,712 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 634 652) the Hoare annotation is: true [2019-10-02 16:25:30,712 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2019-10-02 16:25:30,712 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 634 652) no Hoare annotation was computed. [2019-10-02 16:25:30,713 INFO L439 ceAbstractionStarter]: At program point L247(lines 235 249) the Hoare annotation is: (let ((.cse32 (= ~t1_pc~0 1)) (.cse20 (= ~t1_st~0 0)) (.cse8 (= 1 ~t3_pc~0)) (.cse12 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse4 (= 0 ~E_3~0)) (.cse16 (= 0 ~E_1~0)) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0)) (.cse6 (= ~T3_E~0 1)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_1~0)) (.cse38 (+ ~local~0 2))) (let ((.cse21 (not (<= ~token~0 ~local~0))) (.cse22 (not (<= ~local~0 ~token~0))) (.cse24 (not (<= 2 ~t3_st~0))) (.cse34 (not (<= ~token~0 .cse38))) (.cse35 (not (<= .cse38 ~token~0))) (.cse27 (not .cse15)) (.cse29 (or .cse12 .cse13 .cse0 .cse2 .cse4 .cse16 .cse18 .cse19 .cse6 .cse9 .cse10 .cse11)) (.cse25 (not .cse8)) (.cse26 (not (= 1 ~t2_pc~0))) (.cse33 (or .cse13 .cse0 .cse2 .cse4 .cse16 .cse18 .cse6 .cse9 .cse10 .cse11)) (.cse3 (not (<= ~t2_pc~0 0))) (.cse31 (not .cse20)) (.cse36 (not (= 0 ~m_st~0))) (.cse30 (= 1 ~m_pc~0)) (.cse5 (not .cse32)) (.cse23 (= 0 ~t2_st~0)) (.cse7 (not (<= 2 ~m_st~0))) (.cse14 (= 1 ~E_3~0)) (.cse1 (= is_transmit2_triggered_~__retres1~2 0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse28 (not (<= 2 ~E_2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse5 .cse22 .cse23 .cse24 .cse25 .cse1 .cse26 .cse27 .cse14 .cse17 .cse28 .cse29) (or .cse26 .cse27 .cse14 .cse5 .cse1 .cse23 .cse17 .cse28 .cse24 .cse25 .cse20 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (or .cse21 .cse5 .cse22 .cse23 .cse1 .cse8 .cse26 .cse27 .cse14 .cse17 .cse28 .cse29 .cse30) (or .cse3 .cse21 .cse22 .cse8 .cse31 .cse1 .cse27 .cse14 .cse17 .cse28 .cse29 .cse30) (or .cse27 .cse14 .cse1 .cse23 .cse17 .cse28 .cse32 .cse24 .cse29 .cse30 .cse31) (or .cse0 .cse2 .cse4 .cse23 .cse6 .cse32 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse26 .cse13 .cse1 .cse15 .cse16 .cse17 .cse28 .cse18) (or .cse26 .cse14 .cse15 .cse5 .cse33 .cse23 .cse17 .cse28 .cse7 .cse25 .cse20 .cse1) (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse9 .cse1 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20) (or .cse0 .cse2 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse15 .cse17 .cse20 .cse4 .cse34 .cse5 .cse24 .cse12 .cse26 .cse13 .cse16 .cse28 .cse18 .cse1 .cse35) (or .cse3 .cse23 .cse24 .cse31 .cse27 .cse14 .cse1 .cse17 .cse28 .cse29 .cse30) (or .cse27 .cse14 .cse3 .cse5 .cse17 .cse28 .cse1 .cse24 .cse20 .cse29 .cse30) (or .cse27 .cse14 .cse3 .cse5 .cse17 .cse28 .cse1 .cse20 .cse8 .cse29 .cse30) (or .cse27 .cse14 .cse3 .cse17 .cse28 .cse32 .cse1 .cse24 .cse29 .cse30 .cse31) (or .cse3 (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse0 .cse2 .cse3 .cse21 .cse8 .cse9 .cse10 .cse11 .cse31 .cse14 .cse15 .cse17 .cse4 .cse22 .cse32 .cse1 .cse12 .cse13 .cse36 .cse16 .cse28 .cse18 .cse30) (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse1) (or .cse27 .cse14 .cse23 .cse17 .cse28 .cse32 .cse8 .cse1 .cse29 .cse30 .cse31) (or .cse1 .cse0 .cse2 .cse4 .cse34 .cse5 .cse23 .cse6 .cse7 .cse9 .cse10 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse35) (or .cse26 .cse1 .cse27 .cse14 .cse23 .cse17 .cse28 .cse32 .cse24 .cse25 .cse29 .cse31) (or .cse3 .cse21 .cse22 .cse24 .cse31 .cse27 .cse14 .cse17 .cse28 .cse29 .cse30 .cse1) (or .cse27 .cse14 .cse3 .cse17 .cse28 .cse32 .cse8 .cse29 .cse1 .cse30 .cse31) (or .cse1 .cse27 .cse14 .cse5 .cse23 .cse17 .cse28 .cse24 .cse20 .cse29 .cse30) (or .cse0 .cse2 .cse4 .cse1 .cse5 .cse23 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20) (or (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse3) (or .cse27 .cse14 .cse3 .cse5 .cse23 .cse17 .cse28 .cse8 .cse29 .cse1 .cse30) (or .cse0 .cse2 .cse4 .cse34 .cse5 .cse23 .cse7 .cse1 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse35) (or .cse26 .cse14 .cse15 .cse1 .cse33 .cse23 .cse17 .cse28 .cse32 .cse7 .cse25 .cse31) (or .cse27 .cse14 .cse5 .cse23 .cse17 .cse28 .cse1 .cse20 .cse8 .cse29 .cse30) (let ((.cse37 (+ ~local~0 3))) (or .cse1 .cse5 .cse23 .cse25 (not (<= ~token~0 .cse37)) .cse26 .cse36 .cse14 .cse15 .cse33 .cse17 .cse28 .cse20 (not (<= .cse37 ~token~0)))) (or .cse0 .cse2 .cse3 .cse4 .cse23 .cse32 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse1 .cse30) (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20) (or .cse0 .cse2 .cse4 .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse28 .cse18 .cse20)))) [2019-10-02 16:25:30,713 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 232 250) no Hoare annotation was computed. [2019-10-02 16:25:30,713 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-10-02 16:25:30,714 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 245) no Hoare annotation was computed. [2019-10-02 16:25:30,714 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2019-10-02 16:25:30,714 INFO L446 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 232 250) the Hoare annotation is: true [2019-10-02 16:25:30,714 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 232 250) no Hoare annotation was computed. [2019-10-02 16:25:30,714 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 415 462) the Hoare annotation is: (let ((.cse23 (= ~t1_pc~0 1)) (.cse18 (= ~t1_st~0 0))) (let ((.cse20 (not (<= ~t2_pc~0 0))) (.cse21 (not .cse18)) (.cse27 (not .cse23)) (.cse26 (= 0 ~t2_st~0)) (.cse25 (not (<= 2 ~m_st~0))) (.cse22 (not (= 1 ~t1_i~0))) (.cse24 (not (<= 2 |old(~E_2~0)|))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (= 0 |old(~E_3~0)|)) (.cse4 (= |old(~T3_E~0)| 1)) (.cse5 (not (<= 2 ~t3_st~0))) (.cse6 (= 1 ~t3_pc~0)) (.cse7 (= |old(~T2_E~0)| 0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse9 (= 1 |old(~M_E~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (= |old(~T1_E~0)| 1)) (.cse12 (not (= 0 ~m_st~0))) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 |old(~E_2~0)|)) (.cse19 (= 1 ~m_pc~0)) (.cse1 (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse20 (not (<= ~token~0 ~local~0)) .cse4 .cse7 .cse6 .cse8 .cse9 .cse21 .cse1 .cse13 .cse14 .cse22 .cse3 (not (<= ~local~0 ~token~0)) .cse23 .cse10 .cse11 .cse12 .cse15 .cse24 .cse16 .cse19) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse2 .cse20 .cse26 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse13 .cse14 .cse22 .cse3 .cse23 .cse1 .cse10 .cse11 .cse12 .cse15 .cse24 .cse16 .cse19) (or .cse0 .cse2 .cse3 .cse27 .cse1 .cse26 .cse4 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse22 .cse24 .cse16 .cse18) (let ((.cse28 (+ ~local~0 2))) (or .cse0 .cse2 .cse26 .cse4 .cse25 .cse7 .cse8 .cse9 .cse1 .cse13 .cse14 .cse22 .cse18 .cse3 (not (<= ~token~0 .cse28)) .cse27 .cse10 (not (= 1 ~t2_pc~0)) .cse11 .cse15 .cse24 .cse16 (not (<= .cse28 ~token~0)))) (or .cse0 .cse2 .cse3 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse1 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse27 .cse26 .cse4 .cse25 .cse5 .cse7 .cse8 .cse9 .cse1 .cse10 .cse11 .cse13 .cse14 .cse15 .cse22 .cse24 .cse16 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse1)))) [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L434-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L449-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 415 462) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 415 462) no Hoare annotation was computed. [2019-10-02 16:25:30,715 INFO L443 ceAbstractionStarter]: For program point L419-1(lines 418 461) no Hoare annotation was computed. [2019-10-02 16:25:30,716 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 194 212) no Hoare annotation was computed. [2019-10-02 16:25:30,717 INFO L439 ceAbstractionStarter]: At program point L209(lines 197 211) the Hoare annotation is: (let ((.cse32 (= ~t1_pc~0 1)) (.cse38 (+ ~local~0 2)) (.cse13 (= 1 ~E_1~0)) (.cse23 (= ~t1_st~0 0)) (.cse39 (+ ~local~0 1)) (.cse6 (= 1 ~t3_pc~0))) (let ((.cse25 (not (<= ~token~0 ~local~0))) (.cse26 (not (<= ~local~0 ~token~0))) (.cse37 (not .cse6)) (.cse30 (not (<= .cse39 ~token~0))) (.cse31 (not (<= ~token~0 .cse39))) (.cse24 (not (<= ~t2_pc~0 0))) (.cse29 (not (= 0 ~m_st~0))) (.cse5 (not (<= 2 ~t3_st~0))) (.cse9 (= 1 ~M_E~0)) (.cse34 (not .cse23)) (.cse27 (not .cse13)) (.cse35 (not (<= ~token~0 .cse38))) (.cse20 (not (= 1 ~t2_pc~0))) (.cse36 (not (<= .cse38 ~token~0))) (.cse16 (= 0 ~E_2~0)) (.cse28 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse3 (= 0 is_master_triggered_~__retres1~0)) (.cse17 (not .cse32)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~T3_E~0 1)) (.cse4 (not (<= 2 ~m_st~0))) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse12 (= 1 ~E_3~0)) (.cse14 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 ~E_2~0))) (.cse15 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse13 .cse14 .cse21 .cse22 .cse15 .cse3 .cse23) (or .cse0 .cse1 .cse24 .cse25 .cse19 .cse3 .cse7 .cse8 .cse9 .cse12 .cse21 .cse23 .cse2 .cse17 .cse26 .cse5 .cse10 .cse11 .cse27 .cse22 .cse15 .cse28) (or .cse0 .cse1 .cse2 .cse19 .cse5 .cse6 .cse7 .cse8 .cse10 .cse3 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse28) (or .cse20 .cse30 .cse3 (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse23) .cse31) (or .cse0 .cse1 .cse24 .cse2 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse3 .cse21 .cse22 .cse15 .cse23 .cse28) (or .cse0 .cse1 .cse2 .cse19 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse3 .cse15 .cse16 .cse28) (let ((.cse33 (+ ~local~0 3))) (or .cse0 .cse1 .cse18 .cse19 .cse4 .cse7 .cse8 .cse9 (not (<= ~token~0 .cse33)) .cse12 .cse13 .cse10 .cse21 .cse23 .cse2 .cse17 .cse20 .cse11 .cse14 .cse22 .cse15 .cse3 (not (<= .cse33 ~token~0)))) (or .cse3 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse28) (or .cse0 .cse1 .cse2 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse23 .cse3 .cse28) (or .cse0 .cse1 .cse25 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse12 .cse21 .cse23 .cse3 .cse2 .cse17 .cse26 .cse10 .cse20 .cse11 .cse27 .cse22 .cse15 .cse28) (or .cse0 .cse1 .cse24 .cse2 .cse19 .cse32 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15 .cse3 .cse28) (or .cse3 .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse24 .cse2 .cse25 .cse17 .cse26 .cse19 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15 .cse23 .cse28) (or .cse3 .cse0 .cse1 .cse18 .cse19 .cse4 .cse7 .cse8 .cse9 .cse13 .cse21 .cse23 .cse2 .cse35 .cse17 .cse5 .cse10 .cse20 .cse11 .cse14 .cse22 .cse15 .cse36) (or .cse3 .cse0 .cse1 .cse2 .cse17 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse15 .cse23) (or .cse0 .cse1 .cse2 .cse19 .cse32 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse29 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse28) (or .cse0 .cse1 .cse24 .cse2 .cse17 .cse19 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse21 .cse15 .cse16 .cse23) (or .cse0 .cse1 .cse24 .cse2 .cse17 .cse18 .cse19 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse3 .cse21 .cse22 .cse15 .cse23 .cse28) (or .cse0 .cse3 .cse1 .cse18 .cse4 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21 .cse23 .cse2 .cse35 .cse17 .cse10 .cse20 .cse11 .cse14 .cse22 .cse15 .cse36) (or .cse0 .cse1 .cse24 .cse2 .cse17 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse13 .cse14 .cse21 .cse15 .cse16 .cse23) (or .cse0 .cse1 .cse2 .cse19 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse3 .cse15 .cse16 .cse28) (or .cse0 .cse3 .cse1 .cse2 .cse18 .cse19 .cse32 .cse5 .cse37 .cse7 .cse8 .cse9 .cse34 .cse10 .cse20 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15) (or .cse0 .cse1 .cse24 .cse25 .cse6 .cse7 .cse8 .cse9 .cse34 .cse3 .cse12 .cse13 .cse21 .cse2 .cse26 .cse32 .cse10 .cse11 .cse29 .cse14 .cse22 .cse15 .cse28) (or .cse0 .cse1 .cse25 .cse18 .cse19 .cse3 .cse7 .cse8 .cse9 .cse12 .cse21 .cse23 .cse2 .cse17 .cse26 .cse5 .cse37 .cse10 .cse20 .cse11 .cse27 .cse22 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse21 .cse22 .cse15 .cse23) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse7 .cse3 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28) (or .cse0 .cse1 .cse24 .cse2 .cse18 .cse32 .cse6 .cse7 .cse8 .cse3 .cse9 .cse34 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse21 .cse22 .cse15 .cse28) (or .cse20 (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse23) .cse30 .cse31 .cse3) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse19 .cse32 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15 .cse28) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse3 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse19 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse15 .cse23) (or .cse0 .cse3 .cse1 .cse24 .cse2 .cse19 .cse32 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15 .cse28) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse3 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse15 .cse16 .cse23 .cse28) (or .cse0 .cse1 .cse2 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse3) (or .cse0 .cse1 .cse2 .cse18 .cse19 .cse32 .cse4 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse20 .cse11 .cse13 .cse3 .cse14 .cse21 .cse22 .cse15) (or .cse0 .cse3 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28) (or .cse0 .cse1 .cse2 .cse18 .cse19 .cse32 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse21 .cse22 .cse15 .cse3 .cse28) (or .cse0 .cse1 .cse18 .cse19 .cse4 .cse7 .cse8 .cse12 .cse13 .cse21 .cse23 .cse2 .cse35 .cse17 .cse10 .cse20 .cse11 .cse14 .cse22 .cse15 .cse3 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse19 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse15 .cse23)))) [2019-10-02 16:25:30,717 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 194 212) no Hoare annotation was computed. [2019-10-02 16:25:30,717 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 204) no Hoare annotation was computed. [2019-10-02 16:25:30,717 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 207) no Hoare annotation was computed. [2019-10-02 16:25:30,717 INFO L446 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 194 212) the Hoare annotation is: true [2019-10-02 16:25:30,717 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L578-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 574 621) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L603-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L593-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L583-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L608-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,718 INFO L443 ceAbstractionStarter]: For program point L598-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,719 INFO L439 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 574 621) the Hoare annotation is: (let ((.cse22 (= |old(~T2_E~0)| ~T2_E~0)) (.cse23 (= |old(~T3_E~0)| ~T3_E~0)) (.cse24 (= ~E_3~0 |old(~E_3~0)|)) (.cse27 (= ~E_1~0 |old(~E_1~0)|)) (.cse29 (= ~E_2~0 |old(~E_2~0)|)) (.cse25 (= ~M_E~0 |old(~M_E~0)|)) (.cse26 (= |old(~T1_E~0)| ~T1_E~0)) (.cse28 (= ~E_M~0 |old(~E_M~0)|)) (.cse32 (= ~t1_pc~0 1))) (let ((.cse20 (not (<= 2 ~t3_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse31 (not (= 0 ~m_st~0))) (.cse21 (= 0 |old(~E_2~0)|)) (.cse30 (= 1 ~m_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse3 (not .cse32)) (.cse4 (= 0 ~t2_st~0)) (.cse5 (= |old(~T3_E~0)| 1)) (.cse7 (not (<= 2 ~m_st~0))) (.cse9 (= |old(~T2_E~0)| 0)) (.cse6 (and .cse22 .cse23 .cse24 .cse27 .cse29 .cse25 .cse26 .cse28)) (.cse10 (= 0 |old(~M_E~0)|)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (<= 2 |old(~E_2~0)|))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= ~t1_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse6 .cse3 .cse4 .cse5 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse6 .cse1 .cse2 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse21) (or (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse0 .cse1 .cse2 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse21 .cse30) (or .cse0 .cse1 .cse2 .cse5 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse18 .cse21 .cse19 .cse6 .cse30) (or .cse0 .cse1 .cse2 .cse5 .cse32 .cse20 .cse8 .cse9 .cse10 .cse6 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse18 .cse21 .cse30) (let ((.cse33 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (not (<= ~token~0 .cse33)) .cse3 .cse4 .cse5 .cse7 .cse9 .cse6 .cse10 .cse11 (not (= 1 ~t2_pc~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (<= .cse33 ~token~0))))))) [2019-10-02 16:25:30,719 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 577 620) no Hoare annotation was computed. [2019-10-02 16:25:30,719 INFO L443 ceAbstractionStarter]: For program point L613-1(lines 574 621) no Hoare annotation was computed. [2019-10-02 16:25:30,719 INFO L443 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 554 564) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L439 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 554 564) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse25 (= 1 ~E_1~0)) (.cse23 (<= 2 ~m_st~0)) (.cse46 (+ ~local~0 1)) (.cse45 (= |old(~t2_st~0)| ~t2_st~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse30 (= 1 ~t3_pc~0)) (.cse42 (<= 2 ~t3_st~0)) (.cse43 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse31 (not (= 0 |old(~m_st~0)|))) (.cse32 (and (= ~m_st~0 0) .cse42 .cse43)) (.cse36 (and .cse42 .cse43)) (.cse16 (not .cse30)) (.cse34 (not .cse11)) (.cse8 (and .cse45 .cse42 .cse43)) (.cse38 (not (<= .cse46 ~token~0))) (.cse40 (not (<= ~token~0 .cse46))) (.cse37 (and .cse23 .cse45 .cse43)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse35 (and .cse45 .cse43)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse20 (not .cse25)) (.cse21 (not (<= 2 ~E_2~0))) (.cse28 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse33 (not (<= ~t2_pc~0 0))) (.cse12 (= 0 ~E_3~0)) (.cse39 (and .cse23 .cse45 .cse42 .cse43)) (.cse13 (not .cse29)) (.cse4 (= ~T3_E~0 1)) (.cse24 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 |old(~t3_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse26 (= 0 ~E_1~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse29 .cse15 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse31 .cse25 .cse26 .cse22 .cse27 .cse32 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse4 .cse29 .cse30 .cse5 .cse6 .cse7 .cse34 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse35 .cse22 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse4 .cse29 .cse15 .cse5 .cse6 .cse7 .cse34 .cse17 .cse19 .cse20 .cse9 .cse8 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse29 .cse15 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse28 .cse36) (or .cse0 .cse1 .cse12 .cse3 .cse35 .cse4 .cse29 .cse30 .cse5 .cse6 .cse7 .cse34 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse15 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse31 .cse25 .cse26 .cse22 .cse27 .cse11 .cse32 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse29 .cse24 .cse30 .cse5 .cse6 .cse7 .cse34 .cse17 .cse18 .cse19 .cse25 .cse37 .cse26 .cse10 .cse21 .cse22) (or .cse18 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse38 .cse39 .cse40) (let ((.cse41 (+ ~local~0 3))) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse37 .cse24 .cse16 .cse5 .cse6 .cse7 (not (<= ~token~0 .cse41)) .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 (not (<= .cse41 ~token~0)))) (or .cse0 .cse1 .cse12 (and .cse23 .cse42 .cse43) .cse4 .cse24 .cse15 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse25 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse33 .cse12 .cse13 .cse4 .cse24 .cse30 .cse5 .cse37 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse29 .cse15 .cse8 .cse5 .cse6 .cse7 .cse34 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse13 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse35 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse36 .cse0 .cse1 .cse12 .cse4 .cse15 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse11 .cse28) (or .cse0 .cse1 .cse33 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse29 .cse8 .cse15 .cse16 .cse5 .cse6 .cse7 .cse34 .cse17 .cse18 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse30 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse37) (let ((.cse44 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse39 .cse10 .cse11 .cse12 (not (<= ~token~0 .cse44)) .cse13 .cse15 .cse17 .cse18 .cse19 .cse26 .cse21 .cse22 (not (<= .cse44 ~token~0)))) (or .cse0 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse17 .cse19 .cse23 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse13 .cse3 .cse4 .cse15 .cse5 .cse8 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse2 .cse13 .cse14 .cse4 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse35 .cse28) (or .cse18 .cse38 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse30 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse40 .cse37) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse30 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse33 .cse12 .cse39 .cse13 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11)))) [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 554 564) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 511 553) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 541) no Hoare annotation was computed. [2019-10-02 16:25:30,720 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 16:25:30,722 INFO L439 ceAbstractionStarter]: At program point L537-2(lines 537 541) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse21 (= ~T3_E~0 1)) (.cse28 (= 1 ~t3_pc~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse58 (= ~m_st~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (= 0 ~E_3~0)) (.cse4 (not .cse22)) (.cse5 (= 0 |old(~t2_st~0)|)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 |old(~t3_st~0)|))) (.cse56 (not .cse28)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse12 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 ~E_1~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse30 (= 0 ~E_2~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse67 (+ ~local~0 1)) (.cse50 (<= 2 ~t3_st~0)) (.cse54 (= |old(~t1_st~0)| ~t1_st~0)) (.cse68 (+ ~local~0 2)) (.cse64 (= 1 ~t1_pc~0)) (.cse66 (not .cse21)) (.cse65 (not .cse8)) (.cse53 (<= 2 ~m_st~0)) (.cse60 (not (= ~m_pc~0 1))) (.cse61 (not .cse0)) (.cse62 (not (= 1 ~T2_E~0))) (.cse63 (not (= ~E_3~0 0))) (.cse59 (= |old(~t2_st~0)| ~t2_st~0)) (.cse51 (= 0 ~t1_st~0))) (let ((.cse40 (and .cse59 .cse51)) (.cse45 (and .cse64 .cse66 .cse65 .cse53 .cse60 .cse61 .cse62 .cse63)) (.cse43 (not (<= ~token~0 .cse68))) (.cse44 (not (<= .cse68 ~token~0))) (.cse37 (and .cse53 .cse50 .cse54)) (.cse38 (and .cse59 .cse54)) (.cse35 (and .cse50 .cse54)) (.cse1 (and .cse53 .cse60 .cse61)) (.cse48 (not (<= .cse67 ~token~0))) (.cse49 (not (<= ~token~0 .cse67))) (.cse47 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse56 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 .cse20)) (.cse27 (and .cse58 .cse50 .cse54)) (.cse41 (and .cse53 .cse60)) (.cse11 (and .cse53 .cse59 .cse50 .cse54)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse26 (= 1 ~m_pc~0)) (.cse24 (not .cse20)) (.cse33 (not (<= ~token~0 ~local~0))) (.cse23 (and .cse59 .cse50 .cse54)) (.cse32 (and .cse59 .cse50 .cse51)) (.cse34 (not (<= ~local~0 ~token~0))) (.cse25 (not .cse15)) (.cse46 (and .cse64 .cse65 .cse53 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) .cse60 .cse62 (not .cse14) (not .cse10) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)) (not .cse13) .cse66 (not (= ~E_1~0 1)) .cse61 .cse63 (not (= ~E_1~0 0)))) (.cse31 (not (<= ~t2_pc~0 0))) (.cse52 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 .cse20)) (.cse55 (and .cse53 .cse60 .cse61 .cse62 .cse63)) (.cse42 (and .cse53 .cse59 .cse54)) (.cse36 (and .cse58 .cse59 .cse54)) (.cse39 (not (= 1 ~t2_pc~0))) (.cse18 (not (<= 2 ~E_2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse3 .cse5 .cse21 .cse22 .cse7 .cse8 .cse23 .cse9 .cse10 .cse24 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse26) (or .cse27 .cse0 .cse2 .cse3 .cse22 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse31 .cse5 .cse21 .cse8 .cse9 .cse10 .cse14 .cse23 .cse17 .cse20 .cse3 .cse4 .cse7 .cse12 .cse32 .cse13 .cse25 .cse18 .cse19 .cse26) (or .cse0 .cse2 .cse31 .cse33 .cse21 .cse8 .cse9 .cse10 .cse14 .cse17 .cse20 .cse3 .cse4 .cse34 .cse32 .cse7 .cse12 .cse13 .cse25 .cse23 .cse18 .cse19 .cse26) (or .cse0 .cse2 .cse3 .cse21 .cse22 .cse7 .cse28 .cse8 .cse9 .cse12 .cse13 .cse29 .cse14 .cse15 .cse27 .cse16 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse3 .cse21 .cse22 .cse7 .cse28 .cse8 .cse9 .cse35 .cse10 .cse12 .cse13 .cse25 .cse14 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse31 .cse3 .cse5 .cse22 .cse28 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse29 .cse36 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse2 .cse31 .cse3 .cse21 .cse22 .cse7 .cse8 .cse9 .cse10 .cse24 .cse23 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse26) (or .cse37 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse30) (or .cse0 .cse2 .cse33 .cse5 .cse21 .cse28 .cse8 .cse9 .cse10 .cse14 .cse17 .cse20 .cse3 .cse4 .cse34 .cse38 .cse12 .cse39 .cse13 .cse25 .cse18 .cse19 .cse40 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse37 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse19 .cse30) (or .cse41 .cse0 .cse2 .cse5 .cse21 .cse6 .cse8 .cse42 .cse9 .cse14 .cse15 .cse17 .cse20 .cse3 .cse43 .cse4 .cse12 .cse39 .cse13 .cse16 .cse18 .cse19 .cse44) (or .cse0 .cse2 .cse3 .cse27 .cse21 .cse7 .cse28 .cse8 .cse9 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse30 .cse20 .cse26) (or .cse41 .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse28 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse42) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse28 .cse8 .cse45 .cse9 .cse10 .cse12 .cse39 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse42 .cse20) (or .cse0 .cse38 .cse2 .cse31 .cse33 .cse40 .cse21 .cse28 .cse8 .cse9 .cse10 .cse14 .cse17 .cse20 .cse3 .cse4 .cse34 .cse12 .cse13 .cse25 .cse18 .cse19 .cse26) (or .cse0 .cse38 .cse2 .cse31 .cse3 .cse4 .cse5 .cse21 .cse28 .cse8 .cse40 .cse9 .cse10 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse21 .cse22 .cse6 .cse42 .cse28 .cse8 .cse9 .cse10 .cse24 .cse12 .cse39 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse5 .cse21 .cse6 .cse45 .cse8 .cse9 .cse10 .cse15 .cse11 .cse17 .cse20 .cse3 .cse43 .cse4 .cse7 .cse12 .cse39 .cse13 .cse16 .cse18 .cse19 .cse44) (or .cse39 .cse46 .cse47 .cse37 .cse48 .cse49) (or .cse0 .cse2 .cse31 .cse3 .cse38 .cse21 .cse22 .cse28 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse17 .cse20 .cse3 .cse43 .cse4 .cse42 .cse12 .cse39 .cse13 .cse16 .cse18 .cse19 .cse44) (or .cse0 .cse1 .cse2 .cse3 .cse42 .cse4 .cse5 .cse6 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse41 .cse0 .cse2 .cse3 .cse21 .cse6 .cse7 .cse28 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse19 .cse30) (or .cse38 .cse0 .cse2 .cse3 .cse5 .cse21 .cse22 .cse28 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse2 .cse3 .cse27 .cse21 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse29 .cse15 .cse16 .cse19 .cse30 .cse20 .cse26) (or .cse0 .cse2 .cse3 .cse21 .cse7 (and .cse50 .cse51) .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse14 .cse19 .cse30 .cse20 .cse35 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse41 .cse0 .cse2 .cse3 .cse21 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse39 .cse46 .cse48 .cse52 (and .cse53 .cse54) .cse49) (or .cse46 .cse47 .cse31) (or .cse0 .cse2 .cse31 .cse3 .cse42 .cse4 .cse21 .cse6 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse46 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 .cse20) (or .cse0 .cse2 .cse3 .cse55 .cse21 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse3 .cse27 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse30 .cse20 .cse26) (or .cse0 .cse2 .cse3 .cse21 .cse22 .cse7 .cse28 .cse8 .cse9 .cse27 .cse10 .cse12 .cse13 .cse29 .cse15 .cse16 .cse19 .cse30 .cse26) (or .cse0 .cse2 .cse31 .cse3 .cse4 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse46 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 .cse11 .cse20) (or .cse41 .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse31 .cse33 .cse36 .cse28 .cse8 .cse9 .cse10 .cse24 .cse14 .cse15 .cse17 .cse3 .cse34 .cse22 .cse12 .cse13 .cse29 .cse16 .cse18 .cse19 .cse26) (or .cse0 .cse2 .cse3 .cse23 .cse5 .cse21 .cse22 .cse7 .cse56 .cse8 .cse9 .cse10 .cse24 .cse12 .cse39 .cse13 .cse25 .cse14 .cse17 .cse18 .cse19) (or .cse0 .cse2 .cse33 .cse5 .cse23 .cse21 .cse8 .cse9 .cse10 .cse14 .cse32 .cse17 .cse20 .cse3 .cse4 .cse34 .cse7 .cse56 .cse12 .cse39 .cse13 .cse25 .cse18 .cse19) (or .cse46 .cse31 .cse52) (let ((.cse57 (+ ~local~0 3))) (or .cse0 .cse2 .cse55 .cse5 .cse21 .cse6 .cse8 .cse42 .cse9 .cse10 (not (<= ~token~0 .cse57)) .cse36 .cse14 .cse15 .cse17 .cse20 .cse3 .cse4 .cse56 .cse39 .cse13 .cse16 .cse18 .cse19 (not (<= .cse57 ~token~0)))))))) [2019-10-02 16:25:30,722 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-10-02 16:25:30,722 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-02 16:25:30,723 INFO L439 ceAbstractionStarter]: At program point L529-2(lines 529 533) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse3 (= ~T3_E~0 1))) (let ((.cse9 (= 1 ~E_1~0)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse32 (= 1 ~t3_pc~0)) (.cse24 (= ~t1_pc~0 1)) (.cse56 (= ~m_st~0 0)) (.cse48 (<= 2 ~t3_st~0)) (.cse55 (= |old(~t1_st~0)| ~t1_st~0)) (.cse62 (+ ~local~0 1)) (.cse28 (= 1 ~E_3~0)) (.cse8 (= 1 ~M_E~0)) (.cse19 (= ~T1_E~0 1)) (.cse54 (= |old(~t2_st~0)| ~t2_st~0)) (.cse49 (= 0 ~t1_st~0)) (.cse66 (+ ~local~0 2)) (.cse63 (= 1 ~t1_pc~0)) (.cse65 (not .cse3)) (.cse64 (not .cse5)) (.cse57 (<= 2 ~m_st~0)) (.cse58 (not (= ~m_pc~0 1))) (.cse59 (not .cse0)) (.cse60 (not (= 1 ~T2_E~0))) (.cse61 (not (= ~E_3~0 0)))) (let ((.cse6 (and .cse63 .cse65 .cse64 .cse57 .cse58 .cse59 .cse60 .cse61)) (.cse14 (not (<= ~token~0 .cse66))) (.cse23 (not (<= .cse66 ~token~0))) (.cse39 (and .cse54 .cse49)) (.cse43 (and .cse63 .cse64 .cse57 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) .cse58 .cse60 (not .cse28) (not .cse8) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)) (not .cse19) .cse65 (not (= ~E_1~0 1)) .cse59 .cse61 (not (= ~E_1~0 0)))) (.cse44 (not (<= .cse62 ~token~0))) (.cse45 (not (<= ~token~0 .cse62))) (.cse10 (and .cse57 .cse54 .cse48 .cse55)) (.cse30 (and .cse57 .cse58 .cse59)) (.cse50 (and .cse48 .cse55)) (.cse36 (and .cse56 .cse48 .cse55)) (.cse47 (and .cse57 .cse48 .cse55)) (.cse38 (= 0 ~E_2~0)) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse46 (and .cse57 .cse58)) (.cse33 (not (<= ~t2_pc~0 0))) (.cse34 (and .cse54 .cse48 .cse49)) (.cse40 (not (<= ~token~0 ~local~0))) (.cse41 (not (<= ~local~0 ~token~0))) (.cse16 (not (<= 2 |old(~t3_st~0)|))) (.cse29 (and .cse54 .cse48 .cse55)) (.cse51 (and .cse57 .cse58 .cse59 .cse60 .cse61)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse31 (and .cse57 .cse54 .cse55)) (.cse52 (and .cse56 .cse54 .cse55)) (.cse15 (not .cse24)) (.cse25 (not .cse32)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse20 (= 0 ~E_1~0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 ~E_3~0)) (.cse2 (= 0 |old(~t2_st~0)|)) (.cse7 (= 0 ~M_E~0)) (.cse26 (not .cse12)) (.cse17 (= 1 ~E_M~0)) (.cse27 (not .cse9)) (.cse11 (not (= 1 ~t1_i~0))) (.cse21 (not (<= 2 ~E_2~0))) (.cse22 (= 0 ~E_M~0)) (.cse42 (and .cse54 .cse55)) (.cse35 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse24 .cse16 .cse25 .cse5 .cse7 .cse8 .cse26 .cse17 .cse18 .cse19 .cse27 .cse28 .cse29 .cse11 .cse21 .cse22) (or .cse0 .cse30 .cse31 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse31 .cse0 .cse1 .cse13 .cse15 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse9 .cse20 .cse11 .cse21 .cse22 .cse12) (or .cse0 .cse1 .cse33 .cse2 .cse3 .cse5 .cse7 .cse29 .cse8 .cse28 .cse11 .cse12 .cse13 .cse15 .cse16 .cse34 .cse17 .cse19 .cse27 .cse21 .cse22 .cse35) (or .cse36 .cse0 .cse1 .cse13 .cse24 .cse16 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse37 .cse28 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse0 .cse1 .cse33 .cse39 .cse40 .cse3 .cse32 .cse5 .cse7 .cse8 .cse28 .cse11 .cse12 .cse13 .cse15 .cse41 .cse17 .cse19 .cse27 .cse21 .cse22 .cse42 .cse35) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse32 .cse5 .cse7 .cse8 .cse28 .cse11 .cse39 .cse12 .cse13 .cse42 .cse15 .cse41 .cse17 .cse18 .cse19 .cse27 .cse21 .cse22 .cse35) (or .cse18 .cse43 .cse44 .cse31 (or .cse0 .cse1 .cse13 .cse15 .cse2 .cse3 .cse4 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse22 .cse38 .cse12) .cse45) (or .cse0 .cse1 .cse33 .cse13 .cse3 .cse24 .cse16 .cse5 .cse7 .cse8 .cse26 .cse17 .cse19 .cse27 .cse28 .cse29 .cse11 .cse21 .cse22 .cse35) (or .cse46 .cse0 .cse1 .cse13 .cse31 .cse15 .cse2 .cse3 .cse4 .cse32 .cse5 .cse7 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse21 .cse22 .cse12) (or .cse46 .cse0 .cse1 .cse13 .cse15 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse21 .cse10 .cse22 .cse12) (or .cse47 .cse0 .cse30 .cse1 .cse13 .cse4 .cse16 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse22 .cse38) (or .cse46 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse28 .cse9 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse13 .cse36 .cse3 .cse16 .cse32 .cse5 .cse7 .cse17 .cse19 .cse37 .cse28 .cse9 .cse20 .cse22 .cse38 .cse12 .cse35) (or .cse0 .cse1 .cse13 .cse3 .cse24 .cse16 .cse32 .cse5 .cse7 .cse17 .cse19 .cse37 .cse28 .cse9 .cse20 .cse36 .cse22 .cse38 .cse35) (or .cse0 .cse1 .cse33 .cse13 .cse15 .cse3 .cse4 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse43 .cse28 .cse9 .cse31 .cse20 .cse11 .cse22 .cse38 .cse12) (or .cse0 .cse30 .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse0 .cse10 .cse30 .cse1 .cse13 .cse15 .cse2 .cse4 .cse16 .cse5 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse21 .cse22 .cse12) (or .cse0 .cse1 .cse13 .cse3 .cse16 .cse32 .cse5 (and .cse48 .cse49) .cse7 .cse8 .cse17 .cse19 .cse27 .cse28 .cse50 .cse22 .cse38 .cse12 .cse35) (or .cse0 .cse1 .cse33 .cse13 .cse42 .cse3 .cse24 .cse32 .cse5 .cse7 .cse8 .cse26 .cse17 .cse19 .cse27 .cse28 .cse11 .cse21 .cse22 .cse35) (or .cse0 .cse1 .cse33 .cse13 .cse15 .cse2 .cse3 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse27 .cse28 .cse39 .cse11 .cse21 .cse22 .cse42 .cse12 .cse35) (or .cse0 .cse1 .cse33 .cse13 .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse17 .cse19 .cse43 .cse28 .cse9 .cse20 .cse11 .cse22 .cse38 .cse12) (or .cse46 .cse0 .cse1 .cse13 .cse3 .cse47 .cse4 .cse16 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse9 .cse20 .cse22 .cse38) (or .cse0 .cse1 .cse40 .cse2 .cse3 .cse5 .cse7 .cse8 .cse28 .cse34 .cse11 .cse12 .cse13 .cse15 .cse41 .cse16 .cse25 .cse29 .cse17 .cse18 .cse19 .cse27 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse36 .cse3 .cse16 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse37 .cse9 .cse20 .cse22 .cse38 .cse12 .cse35) (or .cse18 .cse43 (or .cse0 .cse1 .cse13 .cse15 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse22 .cse38 .cse12) .cse44 .cse45 .cse10) (or .cse0 .cse30 .cse1 .cse13 .cse15 .cse2 .cse4 .cse32 .cse5 .cse31 .cse7 .cse8 .cse17 .cse19 .cse28 .cse9 .cse20 .cse11 .cse21 .cse22 .cse12) (or .cse46 .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse17 .cse19 .cse28 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse46 .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse17 .cse19 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse0 .cse1 .cse13 .cse51 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse28 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse0 .cse1 .cse13 .cse3 .cse24 .cse16 .cse32 .cse5 .cse50 .cse7 .cse8 .cse17 .cse19 .cse27 .cse28 .cse22 .cse38 .cse35) (or .cse0 .cse1 .cse33 .cse13 .cse2 .cse24 .cse32 .cse5 .cse52 .cse7 .cse8 .cse26 .cse17 .cse19 .cse37 .cse28 .cse9 .cse20 .cse11 .cse21 .cse22 .cse35) (or .cse0 .cse1 .cse13 .cse36 .cse16 .cse32 .cse5 .cse7 .cse8 .cse17 .cse19 .cse37 .cse28 .cse9 .cse20 .cse22 .cse38 .cse12 .cse35) (or .cse0 .cse1 .cse13 .cse3 .cse24 .cse16 .cse32 .cse5 .cse36 .cse7 .cse8 .cse17 .cse19 .cse37 .cse9 .cse20 .cse22 .cse38 .cse35) (or .cse46 .cse0 .cse1 .cse13 .cse3 .cse4 .cse16 .cse32 .cse5 .cse7 .cse17 .cse19 .cse28 .cse9 .cse47 .cse20 .cse22 .cse38) (or .cse0 .cse1 .cse33 .cse40 .cse52 .cse32 .cse5 .cse7 .cse8 .cse26 .cse28 .cse9 .cse11 .cse13 .cse41 .cse24 .cse17 .cse19 .cse37 .cse20 .cse21 .cse22 .cse35) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse24 .cse16 .cse5 .cse7 .cse8 .cse26 .cse17 .cse19 .cse27 .cse28 .cse11 .cse21 .cse22 .cse29 .cse35) (or .cse46 .cse0 .cse1 .cse13 .cse2 .cse3 .cse24 .cse4 .cse32 .cse5 .cse7 .cse8 .cse26 .cse17 .cse18 .cse19 .cse9 .cse20 .cse11 .cse21 .cse22 .cse31) (or .cse0 .cse1 .cse33 .cse34 .cse40 .cse3 .cse5 .cse7 .cse8 .cse28 .cse11 .cse12 .cse13 .cse15 .cse41 .cse16 .cse17 .cse19 .cse27 .cse29 .cse21 .cse22 .cse35) (let ((.cse53 (+ ~local~0 3))) (or .cse0 .cse1 .cse51 .cse2 .cse3 .cse4 .cse5 .cse31 .cse7 .cse8 (not (<= ~token~0 .cse53)) .cse52 .cse28 .cse9 .cse11 .cse12 .cse13 .cse15 .cse25 .cse18 .cse19 .cse20 .cse21 .cse22 (not (<= .cse53 ~token~0)))) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse24 .cse32 .cse5 .cse7 .cse8 .cse26 .cse17 .cse19 .cse27 .cse28 .cse11 .cse21 .cse22 .cse42 .cse35))))) [2019-10-02 16:25:30,723 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 525) no Hoare annotation was computed. [2019-10-02 16:25:30,724 INFO L439 ceAbstractionStarter]: At program point L519(line 519) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1)) (.cse25 (= 1 ~E_1~0)) (.cse49 (+ ~local~0 1)) (.cse23 (<= 2 ~m_st~0)) (.cse51 (+ ~local~0 2)) (.cse50 (= ~m_st~0 0)) (.cse46 (= |old(~t2_st~0)| ~t2_st~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse31 (= 1 ~t3_pc~0)) (.cse47 (<= 2 ~t3_st~0)) (.cse48 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse38 (and .cse47 .cse48)) (.cse16 (not .cse31)) (.cse36 (not .cse11)) (.cse45 (and .cse50 .cse46 .cse48)) (.cse42 (not (<= ~token~0 .cse51))) (.cse43 (not (<= .cse51 ~token~0))) (.cse33 (and .cse23 .cse47 .cse48)) (.cse8 (and .cse46 .cse47 .cse48)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse29 (and .cse50 .cse47 .cse48)) (.cse40 (not (<= .cse49 ~token~0))) (.cse41 (not (<= ~token~0 .cse49))) (.cse34 (and .cse23 .cse46 .cse48)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse37 (and .cse46 .cse48)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse20 (not .cse25)) (.cse21 (not (<= 2 ~E_2~0))) (.cse28 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse35 (not (<= ~t2_pc~0 0))) (.cse12 (= 0 ~E_3~0)) (.cse39 (and .cse23 .cse46 .cse47 .cse48)) (.cse13 (not .cse30)) (.cse4 (= ~T3_E~0 1)) (.cse24 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 |old(~t3_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse26 (= 0 ~E_1~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse12 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse24 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse25 .cse33 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse25 .cse26 .cse22 .cse27 .cse29 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse34 .cse24 .cse31 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse35 .cse12 .cse4 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse37 .cse22 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse4 .cse30 .cse15 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse8 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse28 .cse38) (or .cse0 .cse1 .cse12 .cse3 .cse37 .cse4 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse25 .cse26 .cse22 .cse27 .cse11 .cse29 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse39 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse12 .cse24 .cse5 .cse23 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse24 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse18 .cse19 .cse25 .cse34 .cse26 .cse10 .cse21 .cse22) (or .cse18 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse40 .cse39 .cse41) (or .cse0 .cse34 .cse1 .cse12 .cse42 .cse13 .cse3 .cse24 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse43) (let ((.cse44 (+ ~local~0 3))) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse34 .cse24 .cse16 .cse5 .cse6 .cse7 (not (<= ~token~0 .cse44)) .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 (not (<= .cse44 ~token~0)))) (or .cse0 .cse33 .cse1 .cse12 .cse4 .cse24 .cse15 .cse31 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse12 .cse42 .cse13 .cse3 .cse4 .cse24 .cse5 .cse34 .cse6 .cse17 .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse43) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse4 .cse24 .cse31 .cse5 .cse34 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) (or .cse0 .cse1 .cse35 .cse12 .cse3 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse32 .cse9 .cse25 .cse45 .cse26 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse15 .cse8 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse38 .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse11 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse37 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse23 .cse0 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse35 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse8 .cse15 .cse16 .cse5 .cse6 .cse7 .cse36 .cse17 .cse18 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse29 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse12 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse11 .cse28) (or .cse0 .cse1 .cse35 .cse2 .cse31 .cse5 .cse6 .cse7 .cse36 .cse9 .cse25 .cse10 .cse45 .cse12 .cse14 .cse30 .cse17 .cse19 .cse32 .cse26 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse34) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse39 .cse10 .cse11 .cse12 .cse42 .cse13 .cse15 .cse17 .cse18 .cse19 .cse26 .cse21 .cse22 .cse43) (or .cse0 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse17 .cse19 .cse23 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse33 .cse24 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse3 .cse4 .cse15 .cse5 .cse8 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse34) (or .cse0 .cse1 .cse35 .cse12 .cse2 .cse13 .cse14 .cse4 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse37 .cse28) (or .cse0 .cse1 .cse12 .cse39 .cse13 .cse3 .cse4 .cse24 .cse15 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse11 .cse29 .cse28) (or .cse18 .cse40 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse41 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse39 .cse13 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11)))) [2019-10-02 16:25:30,726 INFO L439 ceAbstractionStarter]: At program point L521-2(lines 521 525) the Hoare annotation is: (let ((.cse10 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse24 (= ~T3_E~0 1)) (.cse62 (= 1 ~t1_pc~0)) (.cse13 (= ~T1_E~0 1))) (let ((.cse6 (= 1 ~t3_pc~0)) (.cse29 (= ~t1_pc~0 1)) (.cse53 (= ~m_st~0 0)) (.cse15 (= 1 ~E_1~0)) (.cse14 (= 1 ~E_3~0)) (.cse68 (not .cse13)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse71 (not .cse62)) (.cse67 (not (= ~E_M~0 1))) (.cse54 (= |old(~t2_st~0)| ~t2_st~0)) (.cse61 (<= 2 ~t3_st~0)) (.cse55 (= |old(~t1_st~0)| ~t1_st~0)) (.cse69 (not .cse24)) (.cse63 (not .cse7)) (.cse64 (not (= ~M_E~0 0))) (.cse56 (<= 2 ~m_st~0)) (.cse70 (not (= ~E_1~0 1))) (.cse57 (not (= ~m_pc~0 1))) (.cse58 (not .cse0)) (.cse59 (not (= 1 ~T2_E~0))) (.cse60 (not (= ~E_3~0 0))) (.cse65 (not .cse10)) (.cse66 (not (= ~E_2~0 0))) (.cse72 (+ ~local~0 2)) (.cse73 (+ ~local~0 1))) (let ((.cse23 (not (<= .cse73 ~token~0))) (.cse26 (not (<= ~token~0 .cse73))) (.cse27 (not (<= ~token~0 .cse72))) (.cse41 (and .cse62 .cse69 .cse63 .cse64 .cse56 .cse70 .cse57 .cse58 .cse59 .cse60 .cse65 .cse66)) (.cse28 (not (<= .cse72 ~token~0))) (.cse42 (and .cse61 .cse55)) (.cse34 (and .cse54 .cse61 .cse55)) (.cse12 (and .cse62 .cse63 .cse64 .cse56 .cse57 .cse58 .cse59 .cse60 .cse65 .cse67)) (.cse49 (and .cse71 .cse63 .cse56 .cse57 .cse58 .cse59 .cse60)) (.cse36 (and .cse56 .cse61 .cse55)) (.cse32 (not .cse20)) (.cse37 (and .cse68 .cse71 .cse69 .cse63 .cse64 .cse56 .cse70 .cse57 .cse58 .cse59 .cse60 .cse65 .cse67)) (.cse51 (and .cse56 .cse57 .cse58)) (.cse22 (and .cse62 .cse63 .cse64 .cse56 (not (= ~E_M~0 0)) .cse57 .cse59 (not .cse14) .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse58 .cse60 (not (= ~E_1~0 0)))) (.cse44 (not (<= ~t2_pc~0 0))) (.cse45 (not (<= ~token~0 ~local~0))) (.cse38 (and .cse54 .cse55)) (.cse46 (not (<= ~local~0 ~token~0))) (.cse33 (not .cse15)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse25 (= 0 ~E_2~0)) (.cse40 (and .cse53 .cse61 .cse55)) (.cse35 (= 1 ~m_pc~0)) (.cse43 (and .cse62 .cse56 .cse57 .cse58 .cse59 .cse60)) (.cse30 (not (<= 2 |old(~t3_st~0)|))) (.cse11 (= 1 ~E_M~0)) (.cse48 (and .cse56 .cse54 .cse61 .cse55)) (.cse1 (= ~T2_E~0 1)) (.cse50 (and .cse56 .cse57 .cse58 .cse59 .cse60)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse8 (and .cse56 .cse54 .cse55)) (.cse9 (= 0 ~M_E~0)) (.cse47 (and .cse53 .cse54 .cse55)) (.cse17 (not (= 1 ~t1_i~0))) (.cse2 (= 0 ~E_3~0)) (.cse3 (not .cse29)) (.cse31 (not .cse6)) (.cse21 (not (= 1 ~t2_pc~0))) (.cse16 (= 0 ~E_1~0)) (.cse18 (not (<= 2 ~E_2~0))) (.cse19 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse22 .cse23 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20) .cse8 .cse26) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse20 .cse8 .cse2 .cse27 .cse3 .cse11 .cse21 .cse13 .cse16 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse29 .cse30 .cse31 .cse7 .cse9 .cse10 .cse32 .cse11 .cse21 .cse13 .cse33 .cse14 .cse34 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse1 .cse2 .cse36 .cse24 .cse29 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse37 .cse15 .cse16 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse38 .cse4 .cse24 .cse29 .cse6 .cse7 .cse9 .cse10 .cse32 .cse11 .cse13 .cse33 .cse14 .cse17 .cse18 .cse19 .cse35) (or .cse0 .cse1 .cse2 .cse24 .cse29 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse39 .cse15 .cse16 .cse19 .cse25 .cse40 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse41 .cse9 .cse10 .cse11 .cse21 .cse13 .cse15 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse24 .cse29 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse33 .cse14 .cse19 .cse25 .cse35 .cse42) (or .cse0 .cse40 .cse1 .cse2 .cse29 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse39 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse1 .cse2 .cse24 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse39 .cse15 .cse16 .cse19 .cse25 .cse20 .cse40 .cse35) (or .cse0 .cse1 .cse4 .cse43 .cse24 .cse5 .cse7 .cse9 .cse14 .cse15 .cse17 .cse20 .cse8 .cse2 .cse27 .cse3 .cse11 .cse21 .cse13 .cse16 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse5 .cse30 .cse6 .cse7 .cse41 .cse9 .cse10 .cse11 .cse13 .cse15 .cse36 .cse16 .cse19 .cse25) (or .cse0 .cse1 .cse44 .cse2 .cse34 .cse24 .cse29 .cse30 .cse7 .cse9 .cse10 .cse32 .cse11 .cse13 .cse33 .cse14 .cse17 .cse18 .cse19 .cse35) (or .cse0 .cse34 .cse1 .cse44 .cse2 .cse3 .cse4 .cse24 .cse30 .cse7 .cse9 .cse10 .cse11 .cse13 .cse33 .cse14 .cse17 .cse18 .cse19 .cse20 .cse35) (or .cse34 .cse0 .cse1 .cse45 .cse4 .cse24 .cse7 .cse9 .cse10 .cse14 .cse17 .cse20 .cse2 .cse3 .cse46 .cse30 .cse31 .cse11 .cse21 .cse13 .cse33 .cse18 .cse19) (or .cse0 .cse1 .cse44 .cse2 .cse4 .cse29 .cse6 .cse7 .cse9 .cse10 .cse32 .cse47 .cse11 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse35) (or .cse21 .cse22 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse30 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20) .cse23 .cse26 .cse48) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse41 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse1 .cse44 .cse2 .cse45 .cse3 .cse46 .cse38 .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse33 .cse14 .cse17 .cse18 .cse19 .cse20 .cse35) (or .cse0 .cse1 .cse2 .cse24 .cse29 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse37 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse44 .cse2 .cse24 .cse29 .cse6 .cse7 .cse9 .cse10 .cse32 .cse11 .cse13 .cse33 .cse38 .cse14 .cse17 .cse18 .cse19 .cse35) (or .cse22 .cse0 .cse1 .cse44 .cse2 .cse3 .cse8 .cse24 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20) (or .cse0 .cse1 .cse2 .cse29 .cse5 .cse7 .cse49 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse1 .cse4 .cse24 .cse5 .cse7 .cse9 .cse10 .cse15 .cse17 .cse20 .cse2 .cse27 .cse3 .cse48 .cse30 .cse41 .cse11 .cse21 .cse13 .cse16 .cse18 .cse19 .cse28) (or .cse0 .cse1 .cse44 .cse45 .cse24 .cse7 .cse9 .cse10 .cse14 .cse17 .cse20 .cse2 .cse3 .cse46 .cse30 .cse11 .cse13 .cse33 .cse18 .cse19 .cse34 .cse35) (or .cse42 .cse0 .cse1 .cse2 .cse24 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse33 .cse14 .cse19 .cse25 .cse20 .cse35) (or .cse0 .cse1 .cse44 .cse45 .cse6 .cse7 .cse9 .cse10 .cse32 .cse14 .cse15 .cse17 .cse2 .cse46 .cse29 .cse11 .cse13 .cse39 .cse16 .cse18 .cse19 .cse47 .cse35) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse29 .cse30 .cse7 .cse9 .cse10 .cse32 .cse11 .cse13 .cse33 .cse14 .cse34 .cse17 .cse18 .cse19 .cse35) (or .cse0 .cse1 .cse44 .cse2 .cse3 .cse4 .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse33 .cse14 .cse17 .cse18 .cse19 .cse38 .cse20 .cse35) (or .cse0 .cse1 .cse2 .cse24 .cse29 .cse30 .cse6 .cse7 .cse9 .cse40 .cse11 .cse13 .cse39 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse40 .cse0 .cse1 .cse2 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse39 .cse14 .cse15 .cse16 .cse19 .cse25 .cse20 .cse35) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse43 .cse24 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse30 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse36 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse50 .cse24 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse0 .cse36 .cse1 .cse2 .cse29 .cse5 .cse30 .cse6 .cse7 .cse49 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25) (or .cse0 .cse51 .cse36 .cse1 .cse2 .cse24 .cse5 .cse30 .cse6 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse24 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse21 .cse13 .cse15 .cse37 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse51 .cse1 .cse2 .cse24 .cse5 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19 .cse25 .cse35) (or .cse22 .cse0 .cse1 .cse44 .cse2 .cse3 .cse24 .cse5 .cse30 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20) (or .cse0 .cse1 .cse45 .cse4 .cse24 .cse6 .cse7 .cse9 .cse10 .cse14 .cse17 .cse20 .cse38 .cse2 .cse3 .cse46 .cse11 .cse21 .cse13 .cse33 .cse18 .cse19 .cse35) (or .cse0 .cse1 .cse2 .cse24 .cse30 .cse6 .cse7 .cse9 .cse11 .cse13 .cse39 .cse14 .cse15 .cse16 .cse19 .cse25 .cse20 .cse40 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse43 .cse24 .cse5 .cse30 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse48 .cse20) (let ((.cse52 (+ ~local~0 3))) (or .cse0 .cse1 .cse50 .cse4 .cse24 .cse5 .cse7 .cse8 .cse9 .cse10 (not (<= ~token~0 .cse52)) .cse47 .cse14 .cse15 .cse17 .cse20 .cse2 .cse3 .cse31 .cse21 .cse13 .cse16 .cse18 .cse19 (not (<= .cse52 ~token~0)))))))) [2019-10-02 16:25:30,726 INFO L443 ceAbstractionStarter]: For program point L519-1(line 519) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 511 553) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1)) (.cse25 (= 1 ~E_1~0)) (.cse49 (+ ~local~0 1)) (.cse23 (<= 2 ~m_st~0)) (.cse51 (+ ~local~0 2)) (.cse50 (= ~m_st~0 0)) (.cse46 (= |old(~t2_st~0)| ~t2_st~0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse31 (= 1 ~t3_pc~0)) (.cse47 (<= 2 ~t3_st~0)) (.cse48 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse38 (and .cse47 .cse48)) (.cse16 (not .cse31)) (.cse36 (not .cse11)) (.cse45 (and .cse50 .cse46 .cse48)) (.cse42 (not (<= ~token~0 .cse51))) (.cse43 (not (<= .cse51 ~token~0))) (.cse33 (and .cse23 .cse47 .cse48)) (.cse8 (and .cse46 .cse47 .cse48)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse29 (and .cse50 .cse47 .cse48)) (.cse40 (not (<= .cse49 ~token~0))) (.cse41 (not (<= ~token~0 .cse49))) (.cse34 (and .cse23 .cse46 .cse48)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse37 (and .cse46 .cse48)) (.cse18 (not (= 1 ~t2_pc~0))) (.cse20 (not .cse25)) (.cse21 (not (<= 2 ~E_2~0))) (.cse28 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse35 (not (<= ~t2_pc~0 0))) (.cse12 (= 0 ~E_3~0)) (.cse39 (and .cse23 .cse46 .cse47 .cse48)) (.cse13 (not .cse30)) (.cse4 (= ~T3_E~0 1)) (.cse24 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 |old(~t3_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse19 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse26 (= 0 ~E_1~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse27 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse12 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse24 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse25 .cse33 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse25 .cse26 .cse22 .cse27 .cse29 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse34 .cse24 .cse31 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse35 .cse12 .cse4 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse37 .cse22 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse4 .cse30 .cse15 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse8 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse28 .cse38) (or .cse0 .cse1 .cse12 .cse3 .cse37 .cse4 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse25 .cse26 .cse22 .cse27 .cse11 .cse29 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse39 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse12 .cse24 .cse5 .cse23 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse24 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse18 .cse19 .cse25 .cse34 .cse26 .cse10 .cse21 .cse22) (or .cse18 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse40 .cse39 .cse41) (or .cse0 .cse34 .cse1 .cse12 .cse42 .cse13 .cse3 .cse24 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse43) (let ((.cse44 (+ ~local~0 3))) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse34 .cse24 .cse16 .cse5 .cse6 .cse7 (not (<= ~token~0 .cse44)) .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 (not (<= .cse44 ~token~0)))) (or .cse0 .cse33 .cse1 .cse12 .cse4 .cse24 .cse15 .cse31 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse12 .cse42 .cse13 .cse3 .cse4 .cse24 .cse5 .cse34 .cse6 .cse17 .cse18 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse43) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse4 .cse24 .cse31 .cse5 .cse34 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) (or .cse0 .cse1 .cse35 .cse12 .cse3 .cse30 .cse31 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse32 .cse9 .cse25 .cse45 .cse26 .cse10 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse15 .cse8 .cse5 .cse6 .cse7 .cse36 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse28) (or .cse38 .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse22 .cse27 .cse11 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse37 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse23 .cse0 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse35 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse3 .cse4 .cse30 .cse8 .cse15 .cse16 .cse5 .cse6 .cse7 .cse36 .cse17 .cse18 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22) (or .cse0 .cse1 .cse12 .cse4 .cse30 .cse15 .cse31 .cse5 .cse6 .cse29 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse12 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse11 .cse28) (or .cse0 .cse1 .cse35 .cse2 .cse31 .cse5 .cse6 .cse7 .cse36 .cse9 .cse25 .cse10 .cse45 .cse12 .cse14 .cse30 .cse17 .cse19 .cse32 .cse26 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse34) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse39 .cse10 .cse11 .cse12 .cse42 .cse13 .cse15 .cse17 .cse18 .cse19 .cse26 .cse21 .cse22 .cse43) (or .cse0 .cse1 .cse12 .cse4 .cse24 .cse5 .cse6 .cse7 .cse17 .cse19 .cse23 .cse25 .cse26 .cse22 .cse27 .cse28) (or .cse0 .cse1 .cse12 .cse33 .cse24 .cse15 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse22 .cse27) (or .cse0 .cse1 .cse35 .cse12 .cse13 .cse3 .cse4 .cse15 .cse5 .cse8 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse28) (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11 .cse34) (or .cse0 .cse1 .cse35 .cse12 .cse2 .cse13 .cse14 .cse4 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse37 .cse28) (or .cse0 .cse1 .cse12 .cse39 .cse13 .cse3 .cse4 .cse24 .cse15 .cse5 .cse6 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse21 .cse22 .cse11) (or .cse0 .cse1 .cse12 .cse4 .cse15 .cse31 .cse5 .cse6 .cse17 .cse19 .cse32 .cse9 .cse25 .cse26 .cse22 .cse27 .cse11 .cse29 .cse28) (or .cse18 .cse40 (or .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse24 .cse31 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11) .cse41 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28) (or .cse0 .cse1 .cse35 .cse12 .cse39 .cse13 .cse4 .cse24 .cse15 .cse5 .cse6 .cse7 .cse17 .cse19 .cse9 .cse25 .cse26 .cse10 .cse22 .cse27 .cse11)))) [2019-10-02 16:25:30,727 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 511 553) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 328) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 306 335) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 329) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 330) no Hoare annotation was computed. [2019-10-02 16:25:30,727 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 306 335) the Hoare annotation is: true [2019-10-02 16:25:30,728 INFO L439 ceAbstractionStarter]: At program point L332(lines 309 334) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0)) (.cse3 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse19 (not (= 0 ~m_st~0))) (.cse24 (= 1 ~m_pc~0)) (.cse32 (not (<= .cse34 ~token~0))) (.cse15 (not .cse29)) (.cse31 (not .cse3)) (.cse33 (not (<= ~token~0 .cse34))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (= 1 ~t3_pc~0)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse17 (not (= 1 ~t2_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse27 (not (<= ~t2_pc~0 0))) (.cse13 (= 0 ~E_3~0)) (.cse4 (= ~T3_E~0 1)) (.cse30 (not (<= 2 ~m_st~0))) (.cse26 (not (<= 2 ~t3_st~0))) (.cse5 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse28 (not .cse12)) (.cse16 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_3~0)) (.cse10 (= 1 ~E_1~0)) (.cse20 (= exists_runnable_thread_~__retres1~4 1)) (.cse21 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 ~E_2~0))) (.cse23 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse25 (+ ~local~0 3))) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse7 .cse8 (not (<= ~token~0 .cse25)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (not .cse6) .cse26 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 (not (<= .cse25 ~token~0)))) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse20 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse26 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse20 .cse24) (or .cse0 .cse20 .cse1 .cse27 .cse13 .cse3 .cse4 .cse30 .cse26 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse13 .cse4 .cse29 .cse30 .cse6 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse20 .cse29 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse29 .cse26 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse20 .cse24) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse4 .cse30 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse26 .cse16 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse20 .cse1 .cse27 .cse13 .cse3 .cse4 .cse30 .cse6 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse29 .cse30 .cse26 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse23) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse29 .cse30 .cse6 .cse5 .cse20 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse27 .cse2 .cse4 .cse20 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse26 .cse16 .cse18 .cse19 .cse21 .cse22 .cse20 .cse23 .cse24) (or .cse0 .cse31 .cse1 .cse4 .cse30 .cse6 .cse5 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse33 .cse23 .cse20) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse4 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse29 .cse26 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse27 .cse13 .cse2 .cse14 .cse4 .cse30 .cse6 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse21 .cse11 .cse22 .cse20 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse20 .cse11 .cse13 .cse14 .cse26 .cse16 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse20 .cse24) (or .cse0 .cse1 .cse27 .cse13 .cse15 .cse4 .cse30 .cse26 .cse5 .cse7 .cse8 .cse31 .cse16 .cse18 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse23 .cse12) (or .cse0 .cse1 .cse27 .cse13 .cse15 .cse31 .cse4 .cse30 .cse6 .cse5 .cse7 .cse8 .cse16 .cse18 .cse9 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 .cse20) (or .cse0 .cse1 .cse4 .cse30 .cse5 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse12 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse31 .cse22 .cse33 .cse23) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse30 .cse6 .cse5 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse27 .cse13 .cse4 .cse29 .cse30 .cse26 .cse5 .cse7 .cse8 .cse28 .cse16 .cse18 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse23)))) [2019-10-02 16:25:30,728 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 327) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 306 335) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 213 231) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 226) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L446 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 213 231) the Hoare annotation is: true [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2019-10-02 16:25:30,729 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 213 231) no Hoare annotation was computed. [2019-10-02 16:25:30,730 INFO L439 ceAbstractionStarter]: At program point L228(lines 216 230) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse20 (= ~t1_st~0 0)) (.cse6 (= 1 ~t3_pc~0)) (.cse11 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0)) (.cse3 (= ~T3_E~0 1)) (.cse7 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse19 (= 1 ~M_E~0)) (.cse37 (+ ~local~0 1)) (.cse14 (= 1 ~E_1~0)) (.cse38 (+ ~local~0 2))) (let ((.cse31 (not (<= ~token~0 .cse38))) (.cse33 (not (<= .cse38 ~token~0))) (.cse23 (not .cse14)) (.cse35 (not (<= .cse37 ~token~0))) (.cse36 (not (<= ~token~0 .cse37))) (.cse30 (or .cse11 .cse0 .cse1 .cse2 .cse15 .cse16 .cse17 .cse3 .cse7 .cse9 .cse19)) (.cse27 (not .cse6)) (.cse22 (not .cse20)) (.cse12 (not (= 0 ~m_st~0))) (.cse18 (= 1 ~m_pc~0)) (.cse29 (not (= 1 ~t2_pc~0))) (.cse21 (= 0 ~t2_st~0)) (.cse25 (not (<= 2 ~E_2~0))) (.cse34 (not (<= ~t2_pc~0 0))) (.cse26 (not .cse4)) (.cse13 (= 1 ~E_3~0)) (.cse24 (not (= 1 ~t1_i~0))) (.cse8 (= is_transmit1_triggered_~__retres1~1 0)) (.cse32 (not (<= 2 ~m_st~0))) (.cse5 (not (<= 2 ~t3_st~0))) (.cse10 (= 1 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse9 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse18) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse7 .cse9 .cse19 .cse22 .cse10 .cse11 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse8) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse6 .cse7 .cse9 .cse19 .cse22 .cse10 .cse11 .cse23 .cse13 .cse24 .cse25 .cse16 .cse8 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse23 .cse13 .cse16 .cse17 .cse18) (let ((.cse28 (+ ~local~0 3))) (or .cse26 .cse21 .cse27 .cse8 (not (<= ~token~0 .cse28)) .cse29 .cse12 .cse13 .cse14 .cse30 .cse24 .cse25 .cse20 (not (<= .cse28 ~token~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse20 .cse18) (or .cse0 .cse1 .cse2 .cse31 .cse26 .cse8 .cse21 .cse3 .cse32 .cse7 .cse9 .cse10 .cse29 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse20 .cse33) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse32 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse8 .cse21 .cse3 .cse32 .cse7 .cse9 .cse19 .cse14 .cse24 .cse20 .cse2 .cse31 .cse26 .cse5 .cse10 .cse29 .cse11 .cse15 .cse25 .cse16 .cse33) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse3 .cse32 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse8 .cse20) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse32 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse20 .cse8) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse32 .cse6 .cse7 .cse9 .cse19 .cse22 .cse10 .cse29 .cse11 .cse14 .cse8 .cse15 .cse24 .cse25 .cse16) (or .cse0 .cse1 .cse2 .cse8 .cse32 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse29 .cse13 .cse14 .cse26 .cse30 .cse21 .cse24 .cse25 .cse32 .cse27 .cse20 .cse8) (or .cse0 .cse1 .cse2 .cse32 .cse5 .cse8 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse8 .cse13 .cse14 .cse30 .cse32 .cse18) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse19 .cse22 .cse10 .cse11 .cse23 .cse13 .cse24 .cse25 .cse16 .cse8 .cse18) (or .cse0 .cse1 .cse34 (not (<= ~token~0 ~local~0)) .cse6 .cse7 .cse9 .cse19 .cse22 .cse13 .cse14 .cse24 .cse2 (not (<= ~local~0 ~token~0)) .cse4 .cse8 .cse10 .cse11 .cse12 .cse15 .cse25 .cse16 .cse18) (or .cse0 .cse1 .cse34 .cse2 .cse21 .cse4 .cse6 .cse7 .cse9 .cse19 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse8 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse32 .cse7 .cse9 .cse19 .cse8 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse31 .cse26 .cse21 .cse32 .cse8 .cse7 .cse9 .cse19 .cse10 .cse29 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse8 .cse5 .cse27 .cse7 .cse9 .cse19 .cse22 .cse10 .cse29 .cse11 .cse23 .cse13 .cse24 .cse25 .cse16) (or .cse29 .cse35 (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse3 .cse32 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse20) .cse36 .cse8) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse34 .cse2 .cse8 .cse3 .cse4 .cse5 .cse7 .cse9 .cse19 .cse22 .cse10 .cse11 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18) (or .cse29 (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse3 .cse32 .cse5 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse20) .cse35 .cse8 .cse36) (or .cse29 .cse13 .cse14 .cse30 .cse21 .cse24 .cse25 .cse8 .cse4 .cse32 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse14 .cse8 .cse15 .cse16 .cse17 .cse20 .cse18) (or .cse0 .cse1 .cse34 .cse2 .cse26 .cse8 .cse3 .cse32 .cse5 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse32 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse3 .cse32 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse20) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse3 .cse32 .cse6 .cse7 .cse9 .cse19 .cse10 .cse29 .cse11 .cse14 .cse15 .cse24 .cse25 .cse16 .cse20 .cse8) (or .cse0 .cse1 .cse2 .cse26 .cse21 .cse32 .cse5 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16 .cse8 .cse20) (or .cse0 .cse1 .cse34 .cse2 .cse26 .cse3 .cse32 .cse8 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse20) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse32 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17)))) [2019-10-02 16:25:30,730 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,730 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 463 510) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 463 510) the Hoare annotation is: (let ((.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= |old(~T3_E~0)| ~T3_E~0)) (.cse7 (= ~E_3~0 |old(~E_3~0)|)) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= ~E_2~0 |old(~E_2~0)|)) (.cse8 (= ~M_E~0 |old(~M_E~0)|)) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse32 (= ~t1_pc~0 1)) (.cse29 (= ~t1_st~0 0))) (let ((.cse31 (not (<= ~t2_pc~0 0))) (.cse34 (not .cse29)) (.cse25 (not (<= 2 ~t3_st~0))) (.cse35 (not (= 0 ~m_st~0))) (.cse21 (= 0 |old(~E_2~0)|)) (.cse22 (= 1 ~m_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse23 (not .cse32)) (.cse24 (= 0 ~t2_st~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse33 (= 1 ~t3_pc~0)) (.cse4 (= |old(~T2_E~0)| 0)) (.cse13 (= 0 |old(~M_E~0)|)) (.cse14 (= 1 |old(~M_E~0)|)) (.cse15 (= 1 |old(~E_M~0)|)) (.cse16 (= |old(~T1_E~0)| 1)) (.cse17 (= 1 |old(~E_3~0)|)) (.cse18 (= 1 |old(~E_1~0)|)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse27 (not (= 1 ~t1_i~0))) (.cse28 (not (<= 2 |old(~E_2~0)|))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse26 (and .cse5 .cse6 .cse7 .cse10 .cse12 .cse8 .cse9 .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26 .cse19 .cse27 .cse28 .cse20 .cse29) (let ((.cse30 (+ ~local~0 2))) (or .cse0 .cse26 .cse1 .cse2 (not (<= ~token~0 .cse30)) .cse23 .cse24 .cse3 .cse4 .cse13 .cse14 .cse15 (not (= 1 ~t2_pc~0)) .cse16 .cse17 .cse18 .cse19 .cse27 .cse28 .cse20 .cse29 (not (<= .cse30 ~token~0)))) (or .cse0 .cse1 .cse31 .cse2 .cse24 .cse32 .cse33 .cse4 .cse13 .cse14 .cse34 .cse15 .cse16 .cse35 .cse17 .cse18 .cse26 .cse19 .cse27 .cse28 .cse20 .cse22) (or .cse0 .cse1 .cse31 (not (<= ~token~0 ~local~0)) .cse33 .cse4 .cse13 .cse14 .cse34 .cse17 .cse18 .cse27 .cse26 .cse2 (not (<= ~local~0 ~token~0)) .cse32 .cse15 .cse16 .cse35 .cse19 .cse28 .cse20 .cse22) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse25 .cse33 .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse26 .cse0 .cse1 .cse2 .cse32 .cse25 .cse33 .cse4 .cse13 .cse14 .cse15 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse26 .cse0 .cse1 .cse2 .cse25 .cse33 .cse4 .cse13 .cse14 .cse15 .cse16 .cse35 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse24 .cse3 .cse33 .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse28 .cse20 .cse29 .cse26)))) [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point L467-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point L482-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point L497-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,731 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 463 510) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 466 509) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point L287-1(lines 281 304) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 278 305) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point L282-1(lines 281 304) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 278 305) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (not (<= ~t2_pc~0 0)) (not (<= ~token~0 ~local~0)) (= ~T3_E~0 1) (= ~T2_E~0 0) (= 1 ~t3_pc~0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (and (= ~m_st~0 0) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t1_st~0)| ~t1_st~0)) (= 1 ~E_3~0) (= 1 ~E_1~0) (not (= 1 ~t1_i~0)) (= 0 ~E_3~0) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 0 ~E_1~0) (not (<= 2 ~E_2~0)) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point L297-1(lines 278 305) no Hoare annotation was computed. [2019-10-02 16:25:30,732 INFO L443 ceAbstractionStarter]: For program point L292-1(lines 281 304) no Hoare annotation was computed. [2019-10-02 16:25:30,733 INFO L443 ceAbstractionStarter]: For program point masterEXIT(lines 42 85) no Hoare annotation was computed. [2019-10-02 16:25:30,733 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 16:25:30,733 INFO L439 ceAbstractionStarter]: At program point L50(lines 45 84) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse26 (not .cse20)) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse27 (not (= 1 ~t2_pc~0))) (.cse2 (not (<= ~t2_pc~0 0))) (.cse5 (not .cse25)) (.cse24 (= 0 |old(~t2_st~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (<= 2 ~E_2~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= 0 ~E_3~0)) (.cse7 (= ~T3_E~0 1)) (.cse22 (not (<= 2 |old(~t3_st~0)|))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse12 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse19 (= 0 ~E_M~0)) (.cse23 (= 0 ~E_2~0)) (.cse21 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse23 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse24 .cse7 .cse25 .cse22 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse4 .cse24 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse20 .cse3 .cse6 .cse5 .cse22 .cse12 .cse27 .cse13 .cse16 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse25 .cse22 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (let ((.cse28 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse24 .cse7 .cse9 .cse10 .cse11 (not (<= |old(~token~0)| .cse28)) .cse14 .cse15 .cse17 .cse20 .cse3 .cse5 .cse22 (not .cse8) .cse12 .cse27 .cse13 (let ((.cse29 (+ ~local~0 3))) (and (= |old(~token~0)| ~token~0) (<= .cse29 ~token~0) (= ~E_1~0 |old(~E_1~0)|) (= |old(~t2_st~0)| ~t2_st~0) (<= 2 ~t3_st~0) (<= ~token~0 .cse29) (= |old(~t1_st~0)| ~t1_st~0))) .cse16 .cse18 .cse19 (not (<= .cse28 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse24 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse7 .cse25 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse23 .cse21)))) [2019-10-02 16:25:30,734 INFO L439 ceAbstractionStarter]: At program point L79(lines 42 85) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse24 (= |old(~t1_st~0)| 0)) (.cse41 (= ~t1_pc~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse18 (= 1 ~E_3~0)) (.cse10 (= 1 ~M_E~0)) (.cse6 (= ~T3_E~0 1)) (.cse43 (= |old(~t1_st~0)| ~t1_st~0)) (.cse44 (not (= 1 ~T2_E~0))) (.cse32 (<= 2 ~t3_st~0)) (.cse45 (not .cse0)) (.cse13 (<= 2 ~m_st~0)) (.cse31 (<= ~token~0 ~local~0)) (.cse14 (= |old(~t2_st~0)| ~t2_st~0)) (.cse15 (= 0 ~t1_st~0)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not (= ~E_1~0 0))) (.cse33 (<= ~local~0 ~token~0))) (let ((.cse28 (and .cse13 .cse31 .cse14 .cse15 .cse16 .cse17 .cse33)) (.cse27 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse29 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse36 (and .cse13 .cse44 .cse31 .cse14 .cse32 .cse15 .cse16 .cse45 .cse17 .cse33)) (.cse37 (and (not .cse8) (not (= ~M_E~0 0)) .cse13 .cse44 (not .cse18) (not .cse10) .cse14 (not .cse6) .cse32 .cse16 .cse45 (not (= 0 ~t2_st~0)) .cse43 .cse17)) (.cse30 (not (= 1 ~t2_pc~0))) (.cse2 (not (<= ~t2_pc~0 0))) (.cse4 (not .cse41)) (.cse34 (and .cse13 .cse14 .cse32 .cse16 .cse43 .cse17)) (.cse38 (and .cse13 .cse32 .cse16 .cse43 .cse17)) (.cse35 (not (<= 2 |old(~t3_st~0)|))) (.cse39 (= 0 ~E_2~0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= 0 ~E_3~0)) (.cse5 (= 0 |old(~t2_st~0)|)) (.cse7 (= 1 ~t3_pc~0)) (.cse9 (= 0 ~M_E~0)) (.cse42 (not .cse24)) (.cse11 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse19 (= 1 |old(~E_1~0)|)) (.cse25 (and .cse13 .cse14 .cse16 .cse43 .cse17)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (not (<= 2 ~E_2~0))) (.cse23 (= 0 ~E_M~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse21 .cse24 .cse28 .cse3 .cse4 .cse29 .cse11 .cse30 .cse12 .cse25 .cse20 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse2 .cse27 .cse6 .cse8 .cse9 .cse10 .cse18 .cse19 .cse21 .cse24 (and .cse13 .cse31 .cse14 .cse32 .cse15 .cse16 .cse17 .cse33) .cse34 .cse3 .cse4 .cse29 .cse35 .cse11 .cse12 .cse20 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse2 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse21 .cse24 .cse25 .cse3 .cse4 .cse29 .cse28 .cse11 .cse12 .cse20 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse36 .cse27 .cse5 .cse6 .cse8 .cse9 .cse10 .cse18 .cse37 .cse19 .cse21 .cse24 .cse3 .cse29 .cse4 .cse35 .cse11 .cse30 .cse12 .cse20 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse3 .cse6 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse38 .cse19 .cse20 .cse23 .cse39 .cse24 (and .cse13 .cse32 .cse15 .cse16 .cse17) .cse26) (let ((.cse40 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse36 .cse5 .cse6 .cse8 .cse9 .cse10 (not (<= |old(~token~0)| .cse40)) .cse18 .cse19 .cse37 .cse21 .cse24 .cse3 .cse4 .cse35 (not .cse7) .cse11 .cse30 .cse12 .cse20 .cse22 .cse23 (not (<= .cse40 |old(~token~0)|)))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse41 .cse35 .cse8 .cse9 .cse10 .cse42 .cse11 .cse34 .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse41 .cse7 .cse8 .cse9 .cse10 .cse42 .cse11 .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse41 .cse35 .cse8 .cse9 .cse10 .cse42 .cse11 .cse12 .cse18 .cse19 .cse34 .cse20 .cse21 .cse22 .cse23 .cse26) (or (and .cse13 .cse14 .cse32 .cse15 .cse16 .cse17) .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse18 .cse19 .cse21 .cse24 .cse3 .cse4 .cse35 .cse11 .cse12 .cse34 .cse20 .cse22 .cse23 .cse26) (or .cse0 .cse1 .cse3 .cse38 .cse6 .cse41 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse19 .cse20 .cse23 .cse39 .cse26) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse41 .cse7 .cse8 .cse9 .cse10 .cse42 .cse11 .cse12 .cse18 .cse19 .cse25 .cse20 .cse21 .cse22 .cse23 .cse26))))) [2019-10-02 16:25:30,734 INFO L439 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse26 (not .cse20)) (.cse4 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse27 (not (= 1 ~t2_pc~0))) (.cse2 (not (<= ~t2_pc~0 0))) (.cse5 (not .cse25)) (.cse24 (= 0 |old(~t2_st~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (<= 2 ~E_2~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= 0 ~E_3~0)) (.cse7 (= ~T3_E~0 1)) (.cse22 (not (<= 2 |old(~t3_st~0)|))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse12 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse19 (= 0 ~E_M~0)) (.cse23 (= 0 ~E_2~0)) (.cse21 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse23 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse24 .cse7 .cse25 .cse22 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse4 .cse24 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse20 .cse3 .cse6 .cse5 .cse22 .cse12 .cse27 .cse13 .cse16 .cse18 .cse19 .cse21) (let ((.cse28 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse3 .cse5 .cse24 .cse7 .cse22 (not .cse8) .cse9 .cse10 .cse11 (not (<= |old(~token~0)| .cse28)) .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (<= .cse28 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse25 .cse22 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse24 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse7 .cse25 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse23 .cse21)))) [2019-10-02 16:25:30,735 INFO L439 ceAbstractionStarter]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse23 (= ~t1_pc~0 1)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse40 (not (= ~m_pc~0 1))) (.cse33 (= |old(~token~0)| ~token~0)) (.cse35 (= ~E_1~0 |old(~E_1~0)|)) (.cse41 (<= ~token~0 ~local~0)) (.cse36 (= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (<= 2 ~t3_st~0)) (.cse38 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (<= ~local~0 ~token~0))) (let ((.cse10 (and .cse40 .cse33 .cse35 .cse41 .cse36 .cse37 .cse38 .cse42)) (.cse26 (not .cse12)) (.cse29 (and .cse40 .cse35 .cse36 .cse37 .cse38)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse32 (not (= 1 ~t2_pc~0))) (.cse39 (and .cse40 .cse33 .cse35 .cse41 .cse36 .cse38 .cse42)) (.cse2 (not (<= ~t2_pc~0 0))) (.cse14 (not .cse23)) (.cse30 (= 0 |old(~t2_st~0)|)) (.cse24 (and .cse40 .cse35 .cse36 .cse38)) (.cse11 (not (= 1 ~t1_i~0))) (.cse20 (not (<= 2 ~E_2~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 ~E_3~0)) (.cse4 (= ~T3_E~0 1)) (.cse16 (not (<= 2 |old(~t3_st~0)|))) (.cse25 (= 1 ~t3_pc~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_3~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse27 (and .cse40 .cse35 .cse37 .cse38)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse21 (= 0 ~E_M~0)) (.cse28 (= 0 ~E_2~0)) (.cse22 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse4 .cse23 .cse16 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse27 .cse21 .cse28 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse23 .cse16 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse29 .cse22) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse30 .cse4 .cse5 .cse6 .cse7 (not (<= |old(~token~0)| .cse31)) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 (not .cse25) .cse17 .cse32 .cse18 (let ((.cse34 (+ ~local~0 3))) (and .cse33 (<= .cse34 ~token~0) .cse35 .cse36 .cse37 (<= ~token~0 .cse34) .cse38)) .cse19 .cse20 .cse21 (not (<= .cse31 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse13 .cse39 .cse3 .cse14 .cse15 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse10 .cse17 .cse32 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse30 .cse4 .cse23 .cse16 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse29 .cse9 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse30 .cse4 .cse23 .cse25 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse24 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse30 .cse4 .cse16 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse29 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse32 .cse18 .cse19 .cse20 .cse21 .cse39 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse30 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse24 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse13 .cse4 .cse16 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse27 .cse19 .cse21 .cse28 .cse12 .cse22)))) [2019-10-02 16:25:30,736 INFO L439 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse34 (<= ~token~0 ~local~0)) (.cse38 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse35 (= |old(~t2_st~0)| ~t2_st~0)) (.cse40 (not (= ~m_pc~0 1))) (.cse33 (= ~E_1~0 1)) (.cse36 (<= 2 ~t3_st~0)) (.cse37 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse24 (= 0 ~E_2~0)) (.cse22 (and .cse40 .cse33 .cse36 .cse37)) (.cse31 (and .cse40 .cse33 .cse35 .cse37)) (.cse4 (and .cse40 .cse33 .cse35 .cse36 .cse37)) (.cse30 (not .cse20)) (.cse8 (not (<= 2 |old(~t3_st~0)|))) (.cse26 (and .cse40 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse2 (not (<= ~t2_pc~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse25 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (= 0 |old(~t2_st~0)|)) (.cse7 (= ~T3_E~0 1)) (.cse23 (= 1 ~t3_pc~0)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse14 (= 1 ~E_3~0)) (.cse15 (= 1 |old(~E_1~0)|)) (.cse39 (and .cse40 .cse33 .cse34 .cse35 .cse37 .cse38)) (.cse17 (not (= 1 ~t1_i~0))) (.cse3 (= 0 ~E_3~0)) (.cse5 (not .cse29)) (.cse27 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse12 (= 1 ~E_M~0)) (.cse28 (not (= 1 ~t2_pc~0))) (.cse13 (= ~T1_E~0 1)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse18 (not (<= 2 ~E_2~0))) (.cse19 (= 0 ~E_M~0)) (.cse21 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse22 .cse1 .cse3 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse24 .cse20 .cse21) (or .cse0 .cse1 .cse25 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse26 .cse17 .cse20 .cse3 .cse27 .cse5 .cse8 .cse12 .cse28 .cse13 .cse16 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse6 .cse7 .cse29 .cse23 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse31 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse31 .cse0 .cse1 .cse2 .cse3 .cse7 .cse29 .cse23 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse3 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse4 .cse21) (or .cse0 .cse1 .cse3 .cse7 .cse29 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse24 .cse22 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse23 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse32 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse6 .cse7 .cse9 .cse10 .cse11 (not (<= |old(~token~0)| .cse32)) .cse14 .cse15 (and .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse17 .cse20 .cse3 .cse5 .cse8 (not .cse23) .cse12 .cse28 .cse13 .cse16 .cse18 .cse19 (not (<= .cse32 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse25 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse20 .cse3 .cse5 .cse27 .cse8 .cse12 .cse13 .cse16 .cse18 .cse19 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse5 .cse27 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse39 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse25 .cse6 .cse7 .cse23 .cse9 .cse10 .cse11 .cse14 .cse15 .cse39 .cse17 .cse20 .cse3 .cse5 .cse27 .cse12 .cse28 .cse13 .cse16 .cse18 .cse19 .cse21)))) [2019-10-02 16:25:30,736 INFO L443 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2019-10-02 16:25:30,736 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 53) no Hoare annotation was computed. [2019-10-02 16:25:30,736 INFO L439 ceAbstractionStarter]: At program point masterENTRY(lines 42 85) the Hoare annotation is: (let ((.cse23 (= ~t1_pc~0 1)) (.cse12 (= |old(~t1_st~0)| 0)) (.cse40 (not (= ~m_pc~0 1))) (.cse33 (= |old(~token~0)| ~token~0)) (.cse35 (= ~E_1~0 |old(~E_1~0)|)) (.cse41 (<= ~token~0 ~local~0)) (.cse36 (= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (<= 2 ~t3_st~0)) (.cse38 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (<= ~local~0 ~token~0))) (let ((.cse10 (and .cse40 .cse33 .cse35 .cse41 .cse36 .cse37 .cse38 .cse42)) (.cse26 (not .cse12)) (.cse29 (and .cse40 .cse35 .cse36 .cse37 .cse38)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse32 (not (= 1 ~t2_pc~0))) (.cse39 (and .cse40 .cse33 .cse35 .cse41 .cse36 .cse38 .cse42)) (.cse2 (not (<= ~t2_pc~0 0))) (.cse14 (not .cse23)) (.cse30 (= 0 |old(~t2_st~0)|)) (.cse24 (and .cse40 .cse35 .cse36 .cse38)) (.cse11 (not (= 1 ~t1_i~0))) (.cse20 (not (<= 2 ~E_2~0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse13 (= 0 ~E_3~0)) (.cse4 (= ~T3_E~0 1)) (.cse16 (not (<= 2 |old(~t3_st~0)|))) (.cse25 (= 1 ~t3_pc~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_3~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse27 (and .cse40 .cse35 .cse37 .cse38)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse21 (= 0 ~E_M~0)) (.cse28 (= 0 ~E_2~0)) (.cse22 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse4 .cse23 .cse16 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse27 .cse21 .cse28 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse23 .cse16 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse29 .cse22) (let ((.cse31 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse30 .cse4 .cse5 .cse6 .cse7 (not (<= |old(~token~0)| .cse31)) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 (not .cse25) .cse17 .cse32 .cse18 (let ((.cse34 (+ ~local~0 3))) (and .cse33 (<= .cse34 ~token~0) .cse35 .cse36 .cse37 (<= ~token~0 .cse34) .cse38)) .cse19 .cse20 .cse21 (not (<= .cse31 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse13 .cse39 .cse3 .cse14 .cse15 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse10 .cse17 .cse32 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse30 .cse4 .cse23 .cse16 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse29 .cse9 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse13 .cse30 .cse4 .cse23 .cse25 .cse5 .cse6 .cse7 .cse26 .cse17 .cse18 .cse8 .cse9 .cse24 .cse19 .cse11 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse30 .cse4 .cse16 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse19 .cse11 .cse20 .cse29 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse3 .cse30 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse32 .cse18 .cse19 .cse20 .cse21 .cse39 .cse22) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse30 .cse4 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse24 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22) (or .cse0 .cse1 .cse13 .cse4 .cse16 .cse25 .cse5 .cse6 .cse7 .cse17 .cse18 .cse8 .cse9 .cse27 .cse19 .cse21 .cse28 .cse12 .cse22)))) [2019-10-02 16:25:30,737 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 565 573) no Hoare annotation was computed. [2019-10-02 16:25:30,737 INFO L439 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 565 573) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0 1))) (let ((.cse19 (= 0 ~t2_st~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse22 (= ~t1_st~0 0)) (.cse18 (not .cse26)) (.cse21 (not (<= 2 ~E_2~0))) (.cse5 (not (<= 2 ~t3_st~0))) (.cse6 (= 1 ~t3_pc~0)) (.cse23 (not (= 0 ~m_st~0))) (.cse14 (= ~M_E~0 |old(~M_E~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 ~E_3~0)) (.cse3 (= ~T3_E~0 1)) (.cse4 (not (<= 2 ~m_st~0))) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse9 (= 1 |old(~M_E~0)|)) (.cse10 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse12 (= 1 ~E_3~0)) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0)) (.cse24 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse14 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse20 .cse21 .cse16 .cse22) (or .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 .cse13 .cse15 .cse20 .cse21 .cse16 .cse22) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse22 .cse24) (let ((.cse25 (+ ~local~0 2))) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse14 .cse12 .cse13 .cse20 .cse22 .cse2 (not (<= ~token~0 .cse25)) .cse18 .cse10 (not (= 1 ~t2_pc~0)) .cse11 .cse15 .cse21 .cse16 (not (<= .cse25 ~token~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse24 .cse14) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse24)))) [2019-10-02 16:25:30,737 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 565 573) no Hoare annotation was computed. [2019-10-02 16:25:30,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:25:30,737 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~t3_pc~0)| ~t3_pc~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~token~0)| ~token~0) (= |old(~t2_st~0)| ~t2_st~0)) [2019-10-02 16:25:30,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:25:30,738 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2019-10-02 16:25:30,738 INFO L443 ceAbstractionStarter]: For program point is_transmit3_triggeredEXIT(lines 251 269) no Hoare annotation was computed. [2019-10-02 16:25:30,738 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 264) no Hoare annotation was computed. [2019-10-02 16:25:30,738 INFO L446 ceAbstractionStarter]: At program point is_transmit3_triggeredENTRY(lines 251 269) the Hoare annotation is: true [2019-10-02 16:25:30,738 INFO L443 ceAbstractionStarter]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2019-10-02 16:25:30,738 INFO L443 ceAbstractionStarter]: For program point is_transmit3_triggeredFINAL(lines 251 269) no Hoare annotation was computed. [2019-10-02 16:25:30,739 INFO L439 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse21 (= 1 ~E_M~0)) (.cse23 (= 1 ~E_1~0)) (.cse9 (= ~t1_st~0 0)) (.cse17 (= 1 ~t3_pc~0)) (.cse22 (= ~T1_E~0 1)) (.cse12 (= ~T1_E~0 0)) (.cse13 (= ~T2_E~0 1)) (.cse14 (= 0 ~E_3~0)) (.cse24 (= 0 ~E_1~0)) (.cse25 (= 0 ~E_M~0)) (.cse28 (= 0 ~E_2~0)) (.cse15 (= ~T3_E~0 1)) (.cse18 (= ~T2_E~0 0)) (.cse19 (= 0 ~M_E~0)) (.cse20 (= 1 ~M_E~0)) (.cse32 (= ~t1_pc~0 1)) (.cse40 (+ ~local~0 2)) (.cse41 (+ ~local~0 1))) (let ((.cse26 (not (<= .cse41 ~token~0))) (.cse27 (not (<= ~token~0 .cse41))) (.cse38 (not (<= ~token~0 .cse40))) (.cse39 (not (<= .cse40 ~token~0))) (.cse0 (not (= 1 ~t2_pc~0))) (.cse3 (not .cse32)) (.cse30 (or .cse22 .cse12 .cse13 .cse14 .cse24 .cse25 .cse28 .cse15 .cse18 .cse19 .cse20)) (.cse4 (= 0 ~t2_st~0)) (.cse16 (not (<= 2 ~m_st~0))) (.cse8 (not .cse17)) (.cse7 (not (<= 2 ~t3_st~0))) (.cse34 (not (= 0 ~m_st~0))) (.cse31 (not (<= ~t2_pc~0 0))) (.cse35 (not (<= ~token~0 ~local~0))) (.cse36 (not (<= ~local~0 ~token~0))) (.cse33 (not .cse9)) (.cse1 (not .cse23)) (.cse2 (= 1 ~E_3~0)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not (<= 2 ~E_2~0))) (.cse11 (= is_transmit3_triggered_~__retres1~3 0)) (.cse10 (or .cse21 .cse22 .cse12 .cse13 .cse14 .cse24 .cse25 .cse28 .cse15 .cse18 .cse19 .cse20)) (.cse29 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse3 .cse11 .cse4 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9) (or .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse17 .cse18 .cse11 .cse19 .cse20 .cse21 .cse0 .cse22 .cse2 .cse26 .cse23 .cse24 .cse5 .cse27 .cse25 .cse28 .cse9) (or .cse12 .cse13 .cse14 .cse16 .cse18 .cse11 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse25 .cse28 .cse29) (or .cse2 .cse23 .cse11 .cse30 .cse16 .cse29) (or .cse12 .cse13 .cse31 .cse14 .cse4 .cse32 .cse17 .cse18 .cse11 .cse19 .cse20 .cse33 .cse21 .cse22 .cse34 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse29) (or .cse12 .cse13 .cse31 .cse14 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse25 .cse28 .cse9 .cse11) (or .cse1 .cse2 .cse31 .cse11 .cse3 .cse5 .cse6 .cse9 .cse17 .cse10 .cse29) (or .cse11 .cse31 .cse4 .cse7 .cse33 .cse1 .cse2 .cse5 .cse6 .cse10 .cse29) (or .cse12 .cse13 .cse31 .cse14 .cse11 .cse3 .cse15 .cse16 .cse7 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse25 .cse28 .cse9) (or .cse12 .cse13 .cse14 .cse11 .cse15 .cse32 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse28 .cse29) (or .cse11 .cse35 .cse36 .cse4 .cse7 .cse8 .cse33 .cse0 .cse1 .cse2 .cse5 .cse6 .cse10) (or .cse0 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6 .cse32 .cse7 .cse8 .cse10 .cse33) (or .cse1 .cse2 .cse11 .cse31 .cse5 .cse6 .cse32 .cse17 .cse10 .cse29 .cse33) (or .cse1 .cse11 .cse2 .cse4 .cse5 .cse6 .cse32 .cse17 .cse10 .cse29 .cse33) (or .cse12 .cse13 .cse14 .cse11 .cse15 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse28 .cse9 .cse29) (or .cse1 .cse2 .cse11 .cse7 .cse17 .cse10 .cse29) (or .cse1 .cse2 .cse11 .cse4 .cse5 .cse6 .cse32 .cse7 .cse10 .cse29 .cse33) (or .cse12 .cse13 .cse14 .cse3 .cse4 .cse16 .cse7 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9 .cse11) (or .cse12 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse11 .cse5 .cse25 .cse28 .cse9) (or .cse12 .cse13 .cse14 .cse3 .cse4 .cse15 .cse11 .cse16 .cse7 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse25 .cse28 .cse9) (or .cse12 .cse13 .cse14 .cse11 .cse3 .cse15 .cse16 .cse7 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse2 .cse26 .cse23 .cse24 .cse5 .cse27 .cse25 .cse28 .cse9) (or .cse12 .cse11 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse19 .cse21 .cse22 .cse2 .cse23 .cse24 .cse25 .cse28) (or .cse1 .cse2 .cse31 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse10 .cse29) (or .cse12 .cse13 .cse14 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse2 .cse23 .cse11 .cse24 .cse25 .cse28 .cse9 .cse29) (or .cse1 .cse2 .cse31 .cse11 .cse5 .cse6 .cse32 .cse7 .cse10 .cse29 .cse33) (or .cse12 .cse13 .cse14 .cse11 .cse15 .cse16 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse28) (or .cse12 .cse13 .cse14 .cse15 .cse7 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse11 .cse2 .cse23 .cse24 .cse25 .cse28 .cse9 .cse29) (let ((.cse37 (+ ~local~0 3))) (or .cse3 .cse4 .cse8 .cse11 (not (<= ~token~0 .cse37)) .cse0 .cse34 .cse2 .cse23 .cse30 .cse5 .cse6 .cse9 (not (<= .cse37 ~token~0)))) (or .cse12 .cse13 .cse14 .cse11 .cse16 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse25 .cse28) (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse2 .cse23 .cse24 .cse25 .cse28 .cse11 .cse29) (or .cse0 .cse2 .cse23 .cse11 .cse30 .cse4 .cse5 .cse6 .cse32 .cse16 .cse8 .cse33) (or .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse29) (or .cse31 .cse35 .cse36 .cse7 .cse33 .cse1 .cse2 .cse11 .cse5 .cse6 .cse10 .cse29) (or .cse11 .cse12 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9) (or .cse12 .cse11 .cse13 .cse14 .cse38 .cse3 .cse4 .cse15 .cse16 .cse18 .cse19 .cse21 .cse0 .cse22 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9 .cse39) (or .cse12 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse7 .cse18 .cse19 .cse21 .cse22 .cse2 .cse23 .cse11 .cse24 .cse5 .cse6 .cse25 .cse9) (or .cse11 .cse12 .cse13 .cse14 .cse3 .cse4 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9) (or .cse1 .cse2 .cse31 .cse3 .cse4 .cse5 .cse6 .cse11 .cse17 .cse10 .cse29) (or .cse12 .cse13 .cse14 .cse11 .cse38 .cse3 .cse4 .cse16 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse2 .cse23 .cse24 .cse5 .cse6 .cse25 .cse9 .cse39) (or .cse12 .cse13 .cse14 .cse4 .cse15 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21 .cse0 .cse22 .cse23 .cse24 .cse11 .cse5 .cse6 .cse25) (or .cse12 .cse13 .cse31 .cse35 .cse11 .cse17 .cse18 .cse19 .cse20 .cse33 .cse2 .cse23 .cse5 .cse14 .cse36 .cse32 .cse21 .cse22 .cse34 .cse24 .cse6 .cse25 .cse29) (or .cse11 .cse35 .cse36 .cse4 .cse17 .cse33 .cse0 .cse1 .cse2 .cse5 .cse6 .cse10 .cse29) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse17 .cse11 .cse10 .cse29) (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse7 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse2 .cse23 .cse24 .cse25 .cse28 .cse29) (or .cse0 .cse2 .cse23 .cse3 .cse30 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11) (or .cse11 .cse12 .cse13 .cse14 .cse32 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse2 .cse23 .cse24 .cse25 .cse28 .cse29) (or .cse31 .cse35 .cse36 .cse17 .cse33 .cse1 .cse2 .cse5 .cse6 .cse11 .cse10 .cse29)))) [2019-10-02 16:25:30,739 INFO L443 ceAbstractionStarter]: For program point L345(line 345) no Hoare annotation was computed. [2019-10-02 16:25:30,739 INFO L443 ceAbstractionStarter]: For program point L366(lines 342 408) no Hoare annotation was computed. [2019-10-02 16:25:30,740 INFO L439 ceAbstractionStarter]: At program point L358(line 358) the Hoare annotation is: (let ((.cse12 (= ~T1_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse7 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse9 (= 1 ~M_E~0)) (.cse34 (= 1 ~t3_pc~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse27 (= 0 ~t1_st~0))) (let ((.cse4 (= |old(~t1_pc~0)| 1)) (.cse21 (<= 2 ~t3_st~0)) (.cse32 (<= 2 ~E_2~0)) (.cse22 (not .cse27)) (.cse48 (<= ~t2_pc~0 0)) (.cse19 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse26 (not .cse20)) (.cse55 (not .cse34)) (.cse54 (= ~t1_i~0 1)) (.cse24 (not (= ~m_pc~0 1))) (.cse31 (not (= 0 ~t2_st~0))) (.cse42 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (and (not .cse12) (not .cse3) (not .cse7) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse9) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse35 (= eval_~tmp~0 1)) (.cse49 (= |old(~t2_st~0)| ~t2_st~0)) (.cse50 (<= |old(~E_2~0)| ~E_2~0)) (.cse56 (+ ~local~0 3)) (.cse38 (= |old(~t1_st~0)| 0))) (let ((.cse43 (not (<= |old(~t2_pc~0)| 0))) (.cse10 (not .cse38)) (.cse29 (<= .cse56 ~token~0)) (.cse30 (<= ~token~0 .cse56)) (.cse44 (and .cse19 .cse26 .cse55 .cse54 .cse27 .cse24 .cse31 .cse42 .cse23 .cse35 .cse49 .cse50)) (.cse45 (and .cse19 .cse20 .cse55 .cse22 .cse54 .cse48 .cse24 .cse31 .cse23 .cse35 .cse49 .cse50)) (.cse46 (and .cse20 .cse21 .cse22 .cse34 .cse54 .cse48 .cse24 .cse31 .cse32 .cse23 .cse35 .cse49 .cse50)) (.cse33 (= 1 ~t2_pc~0)) (.cse47 (and .cse26 .cse21 .cse34 .cse54 .cse27 .cse24 .cse31 .cse42 .cse32 .cse23 .cse35 .cse49 .cse50)) (.cse6 (= 1 |old(~t3_pc~0)|)) (.cse13 (not (= 0 |old(~m_st~0)|))) (.cse18 (= 0 |old(~E_2~0)|)) (.cse25 (= 1 |old(~m_pc~0)|)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse40 (not .cse4)) (.cse36 (= 0 |old(~t2_st~0)|)) (.cse28 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 |old(~t3_st~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse14 (= 1 |old(~E_3~0)|)) (.cse15 (= 1 |old(~E_1~0)|)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse37 (not (= 1 ~t1_i~0))) (.cse41 (not (<= 2 |old(~E_2~0)|))) (.cse17 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 (and .cse19 .cse26 .cse21 .cse23 .cse27 .cse24)) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse39 (+ |old(~local~0)| 2))) (or .cse0 .cse1 (and .cse29 .cse30 (and .cse31 .cse32 (and .cse20 .cse33 .cse21 .cse22 .cse34 .cse23 .cse35))) .cse36 .cse3 .cse28 .cse7 .cse8 .cse9 .cse14 .cse15 .cse37 .cse38 .cse2 (not (<= |old(~token~0)| .cse39)) .cse40 .cse11 (not (= 1 |old(~t2_pc~0)|)) .cse12 .cse16 .cse41 .cse17 (not (<= .cse39 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 (and .cse19 .cse26 .cse21 .cse42 .cse23 .cse24) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse38 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25) (or .cse0 .cse1 .cse2 .cse40 .cse36 .cse3 .cse28 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse37 .cse41 .cse17 .cse38) (or .cse0 .cse1 .cse43 .cse36 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse37 .cse44 .cse2 .cse45 .cse4 .cse11 .cse12 .cse13 .cse16 .cse41 .cse46 .cse17 .cse25 .cse47) (let ((.cse51 (= |old(~token~0)| ~token~0)) (.cse52 (<= ~token~0 ~local~0)) (.cse53 (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse43 (and .cse19 .cse26 .cse48 .cse24 .cse42 .cse23 .cse35 .cse49 .cse50) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse7 .cse6 .cse8 (and .cse33 .cse26 .cse21 .cse34 .cse24 .cse31 .cse42 .cse23 .cse35 .cse50) .cse9 .cse10 (and .cse29 .cse30 (and .cse20 .cse31 .cse33 .cse21 .cse22 .cse34 .cse32 .cse23 .cse35)) .cse14 .cse15 .cse37 .cse44 (and .cse26 .cse21 .cse34 .cse48 .cse24 .cse42 .cse23 .cse35 .cse49 .cse50) (and .cse19 .cse20 .cse22 .cse48 .cse24 .cse51 .cse52 .cse23 .cse35 .cse53 .cse49 .cse50) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse45 .cse4 (and (and .cse20 .cse31 .cse33 .cse21 .cse22 .cse34 .cse32 .cse23 .cse35 .cse24) .cse52 .cse53 .cse51) (and (and .cse19 .cse20 .cse31 .cse33 .cse22 .cse23 .cse35 .cse24 .cse50) .cse52 .cse53 .cse51) (and .cse20 .cse21 .cse22 .cse34 .cse48 .cse24 .cse51 .cse52 .cse23 .cse35 .cse53 .cse49 .cse50) .cse11 .cse12 .cse13 .cse16 .cse46 .cse41 .cse17 (and .cse19 .cse33 .cse26 .cse24 .cse31 .cse42 .cse23 .cse35 .cse50) .cse47 .cse25)) (or .cse0 .cse1 .cse2 .cse40 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse19 .cse20 .cse21 .cse42 .cse23 .cse24) .cse17 .cse18 .cse38 .cse25) (or .cse0 .cse1 .cse2 .cse40 .cse36 .cse3 .cse28 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse37 .cse41 .cse17 .cse38))))) [2019-10-02 16:25:30,740 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-10-02 16:25:30,740 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 336 414) no Hoare annotation was computed. [2019-10-02 16:25:30,741 INFO L439 ceAbstractionStarter]: At program point L400(line 400) the Hoare annotation is: (let ((.cse12 (= ~T1_E~0 1)) (.cse4 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= 1 ~M_E~0)) (.cse52 (= 0 ~t1_st~0)) (.cse30 (= 1 ~t3_pc~0))) (let ((.cse40 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse28 (= 1 ~t1_pc~0)) (.cse26 (= 1 ~t2_pc~0)) (.cse64 (not .cse30)) (.cse29 (not .cse52)) (.cse31 (<= 2 ~m_st~0)) (.cse65 (= ~t1_i~0 1)) (.cse32 (and (not .cse12) (not .cse4) (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse10) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse33 (not (= eval_~tmp~0 0)))) (let ((.cse21 (= |old(~t1_pc~0)| 1)) (.cse42 (= ~m_st~0 0)) (.cse58 (and .cse40 .cse28 .cse26 .cse64 .cse29 .cse31 .cse65 .cse32 .cse33)) (.cse50 (<= ~t2_pc~0 0)) (.cse34 (<= 2 ~E_2~0)) (.cse60 (and .cse40 .cse28 .cse64 .cse29 .cse31 .cse32 .cse33)) (.cse25 (= |old(~t1_st~0)| 0)) (.cse43 (not (= ~m_pc~0 1))) (.cse41 (not .cse28)) (.cse27 (not (= 0 ~t2_st~0))) (.cse44 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (= eval_~tmp~0 1)) (.cse51 (= |old(~t2_st~0)| ~t2_st~0)) (.cse46 (<= |old(~E_2~0)| ~E_2~0)) (.cse66 (+ ~local~0 2))) (let ((.cse35 (<= .cse66 ~token~0)) (.cse36 (<= ~token~0 .cse66)) (.cse18 (= 0 |old(~E_2~0)|)) (.cse61 (and .cse40 .cse41 .cse31 .cse52 .cse27 .cse44 .cse32 .cse45 .cse51 .cse46)) (.cse62 (not (<= |old(~t2_pc~0)| 0))) (.cse19 (and .cse31 .cse32 .cse43)) (.cse53 (not .cse25)) (.cse54 (and .cse27 .cse34 .cse60 .cse51)) (.cse55 (and .cse40 .cse28 .cse64 .cse31 .cse65 .cse52 .cse50 .cse27 .cse32 .cse45 .cse51 .cse46)) (.cse56 (and .cse27 .cse34 .cse58)) (.cse63 (and .cse40 .cse28 .cse64 .cse29 .cse42 .cse65 .cse50 .cse43 .cse27 .cse32 .cse45 .cse51 .cse46)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse59 (and .cse40 .cse41 .cse64 .cse42 .cse65 .cse52 .cse50 .cse43 .cse27 .cse44 .cse32 .cse45 .cse51 .cse46)) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse7 (= 1 |old(~t3_pc~0)|)) (.cse38 (not (= 1 |old(~t2_pc~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse3 (not .cse21)) (.cse23 (= 0 |old(~t2_st~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~t3_st~0)|))) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (and .cse28 .cse31 .cse32 .cse43)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse39 (not (<= 2 |old(~E_2~0)|))) (.cse17 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse21 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (let ((.cse37 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse23 .cse4 .cse5 .cse8 .cse9 .cse10 .cse13 .cse14 .cse24 .cse25 (and .cse26 (and .cse27 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse34) .cse35 .cse36) .cse2 (not (<= |old(~token~0)| .cse37)) .cse3 (not .cse7) .cse11 .cse38 .cse12 .cse15 .cse16 .cse39 .cse17 (not (<= .cse37 |old(~token~0)|)))) (let ((.cse47 (<= ~token~0 ~local~0)) (.cse48 (<= ~local~0 ~token~0)) (.cse49 (= |old(~token~0)| ~token~0))) (or .cse0 (and (and .cse40 .cse26 .cse41 .cse42 .cse43 .cse27 .cse44 .cse32 .cse45 .cse46) .cse47 .cse48 .cse49) (and .cse40 .cse41 .cse42 .cse50 .cse43 .cse49 .cse44 .cse47 .cse32 .cse45 .cse48 .cse51 .cse46) (and (and .cse40 .cse27 .cse26 .cse31 .cse32 .cse52 .cse45 .cse46) .cse47 .cse48) .cse19 .cse9 .cse10 .cse53 .cse54 .cse13 .cse55 .cse56 (not (<= |old(~local~0)| |old(~token~0)|)) .cse21 (let ((.cse57 (+ ~local~0 1))) (and (<= ~token~0 .cse57) (and .cse34 .cse58) (<= .cse57 ~token~0))) .cse11 .cse59 .cse16 .cse17 (and .cse34 .cse60 .cse50 .cse51) .cse61 .cse1 .cse62 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse8 .cse7 .cse14 .cse24 (and .cse40 .cse28 .cse29 .cse42 .cse50 .cse43 .cse49 .cse47 .cse32 .cse45 .cse48 .cse51 .cse46) (and .cse40 .cse31 .cse52 .cse50 .cse47 .cse32 .cse45 .cse48 .cse51 .cse46) (and (and .cse40 .cse28 .cse26 .cse29 .cse42 .cse43 .cse27 .cse32 .cse45 .cse46) .cse47 .cse48 .cse49) .cse2 .cse63 .cse12 .cse22 (and (and .cse27 .cse34 (and .cse28 .cse26 .cse29 .cse30 .cse31 .cse32 .cse33)) .cse35 .cse36) (and .cse40 .cse26 .cse41 .cse31 .cse27 .cse44 .cse32 .cse45 .cse46) .cse39 (and .cse40 .cse41 .cse31 .cse50 .cse44 .cse32 .cse45 .cse51 .cse46) .cse20)) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and (and .cse40 .cse28 .cse44 .cse31 .cse32 .cse33) .cse51 .cse46) .cse13 .cse14 .cse15 .cse16 .cse24 .cse39 .cse17 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20) (or .cse0 .cse61 .cse1 .cse62 .cse23 .cse4 .cse7 .cse8 .cse19 .cse9 .cse10 .cse53 .cse54 .cse13 .cse14 .cse24 .cse2 .cse55 .cse56 .cse63 .cse21 .cse11 .cse12 .cse22 .cse59 .cse16 .cse39 .cse17 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse24 .cse39 .cse17 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse39 .cse17 .cse25)))))) [2019-10-02 16:25:30,742 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2019-10-02 16:25:30,742 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 336 414) the Hoare annotation is: (let ((.cse4 (= |old(~t1_pc~0)| 1)) (.cse34 (= 1 ~t1_pc~0)) (.cse31 (= |old(~t1_st~0)| 0)) (.cse27 (= 1 |old(~t3_pc~0)|))) (let ((.cse32 (not (<= 2 |old(~t3_st~0)|))) (.cse37 (<= 2 ~t3_st~0)) (.cse35 (= 1 ~t3_pc~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse33 (not .cse27)) (.cse28 (not (= 1 |old(~t2_pc~0)|))) (.cse26 (= 0 |old(~t2_st~0)|)) (.cse42 (not (<= |old(~t2_pc~0)| 0))) (.cse43 (not .cse31)) (.cse39 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse40 (= ~m_st~0 0)) (.cse44 (<= ~t2_pc~0 0)) (.cse45 (= |old(~token~0)| ~token~0)) (.cse36 (= |old(~t2_st~0)| ~t2_st~0)) (.cse14 (not .cse34)) (.cse38 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (not (= 1 ~t1_i~0))) (.cse41 (not (= 0 |old(~m_st~0)|))) (.cse30 (not (<= 2 |old(~E_2~0)|))) (.cse9 (<= 2 ~m_st~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= ~E_3~0 |old(~E_3~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_2~0 |old(~E_2~0)|)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse25 (not .cse4)) (.cse3 (= ~T3_E~0 1)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse16 (= 1 |old(~E_M~0)|)) (.cse17 (= ~T1_E~0 1)) (.cse18 (= 1 |old(~E_3~0)|)) (.cse19 (= 1 |old(~E_1~0)|)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse21 (= 0 |old(~E_M~0)|)) (.cse22 (= 0 |old(~E_2~0)|)) (.cse23 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse1 .cse2 .cse25 .cse26 .cse3 .cse5 .cse27 .cse6 .cse7 .cse8 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse29 .cse30 .cse21 .cse31) (or .cse0 .cse1 .cse2 .cse25 .cse26 .cse3 .cse5 .cse32 .cse33 .cse6 .cse7 .cse8 (and .cse34 .cse35 .cse9 .cse11 .cse12 .cse13 .cse36 .cse37 .cse38 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse30 .cse21 .cse31) (or .cse0 .cse1 .cse2 (and .cse39 .cse40 .cse10 .cse11 .cse12 .cse13 .cse14 .cse37 .cse38 .cse15) .cse3 .cse4 .cse32 .cse27 .cse6 .cse7 .cse8 .cse16 .cse17 .cse41 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse25 .cse26 .cse3 .cse5 .cse32 .cse6 .cse7 .cse8 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse24 .cse29 .cse30 .cse21 .cse31) (or .cse0 .cse1 .cse42 .cse26 .cse3 .cse27 .cse6 .cse7 .cse8 .cse43 .cse18 .cse19 .cse29 .cse2 .cse4 (and .cse39 .cse40 .cse44 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse38 .cse15) .cse16 .cse17 .cse41 .cse20 .cse30 .cse21 .cse23) (or .cse0 (and .cse39 .cse34 .cse40 .cse10 .cse11 .cse12 .cse13 .cse37 .cse38 .cse15) .cse1 .cse2 .cse25 .cse3 .cse32 .cse27 .cse6 .cse7 .cse8 .cse16 .cse17 .cse41 .cse18 .cse19 .cse20 .cse21 .cse22 .cse31 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse27 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 (and .cse39 .cse9 .cse11 .cse12 .cse13 .cse14 .cse37 .cse38 .cse15) .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse25 .cse3 .cse5 .cse32 .cse27 .cse6 .cse7 .cse8 .cse16 (and .cse39 .cse34 .cse9 .cse11 .cse12 .cse13 .cse37 .cse38 .cse15) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse47 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse26 .cse3 .cse5 .cse6 .cse7 .cse8 (let ((.cse46 (+ ~local~0 2))) (and .cse34 .cse35 .cse9 .cse45 .cse11 .cse12 .cse13 .cse36 (<= ~token~0 .cse46) .cse24 .cse38 (<= .cse46 ~token~0) .cse15)) .cse18 .cse19 .cse29 .cse31 .cse2 (not (<= |old(~token~0)| .cse47)) .cse25 .cse33 .cse16 .cse28 .cse17 .cse20 .cse30 .cse21 (not (<= .cse47 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse25 (and .cse39 .cse34 .cse9 .cse11 .cse12 .cse13 .cse36 .cse38 .cse15) .cse26 .cse3 .cse5 .cse27 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse30 .cse21 .cse31) (or .cse0 .cse1 .cse42 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse6 .cse27 .cse7 .cse8 .cse43 (and .cse39 .cse40 .cse44 .cse10 .cse45 .cse11 .cse12 (<= ~token~0 ~local~0) .cse13 .cse36 .cse14 .cse38 .cse15 (<= ~local~0 ~token~0)) .cse18 .cse19 .cse29 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 .cse16 .cse17 .cse41 .cse20 .cse30 .cse21 .cse23) (or (and .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) .cse0 .cse1 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-10-02 16:25:30,742 INFO L443 ceAbstractionStarter]: For program point L380(lines 342 408) no Hoare annotation was computed. [2019-10-02 16:25:30,743 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-10-02 16:25:30,743 INFO L443 ceAbstractionStarter]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2019-10-02 16:25:30,744 INFO L439 ceAbstractionStarter]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse19 (= ~T1_E~0 1)) (.cse12 (= ~T3_E~0 1)) (.cse15 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse17 (= 1 ~M_E~0)) (.cse54 (= 0 ~t1_st~0)) (.cse23 (= 1 ~t3_pc~0)) (.cse6 (= 1 ~t1_pc~0))) (let ((.cse14 (= 1 |old(~t3_pc~0)|)) (.cse33 (= |old(~t1_pc~0)| 1)) (.cse41 (= 1 ~t2_pc~0)) (.cse40 (not (= 0 ~t2_st~0))) (.cse43 (<= 2 ~E_2~0)) (.cse60 (= ~t1_i~0 1)) (.cse10 (= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (= |old(~t1_st~0)| 0)) (.cse53 (not (= ~m_pc~0 1))) (.cse62 (+ ~local~0 2)) (.cse5 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse51 (not .cse6)) (.cse61 (not .cse23)) (.cse22 (<= 2 ~t3_st~0)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (not .cse54)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (and (not .cse19) (not .cse12) (not .cse15) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse17) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))))) (let ((.cse38 (and .cse5 .cse51 .cse61 .cse22 .cse7 .cse42 .cse8 .cse9)) (.cse36 (and .cse5 .cse51 .cse61 .cse22 .cse7 .cse8 .cse9 .cse54)) (.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse52 (= ~m_st~0 0)) (.cse37 (and .cse5 .cse6 .cse61 .cse22 .cse42 .cse8 .cse9)) (.cse55 (and .cse5 .cse6 .cse61 .cse22 .cse8 .cse9 .cse54)) (.cse31 (= 0 |old(~E_2~0)|)) (.cse44 (<= .cse62 ~token~0)) (.cse45 (<= ~token~0 .cse62)) (.cse39 (not (<= |old(~t2_pc~0)| 0))) (.cse30 (and .cse8 .cse9 .cse53)) (.cse35 (not .cse29)) (.cse46 (and .cse5 .cse6 .cse40 .cse61 .cse42 .cse43 .cse8 .cse60 .cse9 .cse10)) (.cse47 (and .cse6 .cse40 .cse41 .cse22 .cse42 .cse23 .cse43 .cse8 .cse60 .cse9)) (.cse48 (not (= 0 |old(~m_st~0)|))) (.cse49 (and .cse5 .cse6 .cse40 .cse41 .cse61 .cse42 .cse43 .cse8 .cse60 .cse9)) (.cse50 (and .cse6 .cse40 .cse22 .cse42 .cse23 .cse43 .cse8 .cse60 .cse9 .cse10)) (.cse32 (= 1 |old(~m_pc~0)|)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~E_3~0)|)) (.cse21 (= 1 |old(~E_1~0)|)) (.cse26 (not (= 1 ~t1_i~0))) (.cse2 (= 0 |old(~E_3~0)|)) (.cse3 (not .cse33)) (.cse34 (not (<= 2 |old(~t3_st~0)|))) (.cse56 (not .cse14)) (.cse18 (= 1 |old(~E_M~0)|)) (.cse59 (not (= 1 |old(~t2_pc~0)|))) (.cse24 (and .cse6 .cse8 .cse9 .cse53)) (.cse25 (= 0 |old(~E_1~0)|)) (.cse27 (not (<= 2 |old(~E_2~0)|))) (.cse28 (= 0 |old(~E_M~0)|)) (.cse57 (and .cse6 .cse41 .cse22 .cse42 .cse23 .cse8 .cse60 .cse9 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse6 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse28 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse12 .cse33 .cse13 .cse34 .cse14 .cse15 .cse30 .cse16 .cse17 .cse35 .cse36 .cse18 .cse19 .cse20 .cse21 .cse25 .cse37 .cse28 .cse31) (or .cse0 .cse1 .cse2 .cse38 .cse12 .cse33 .cse13 .cse34 .cse14 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25 .cse28 .cse31 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse28 .cse31 (and .cse5 .cse6 .cse22 .cse8 .cse9)) (or .cse0 .cse1 .cse39 (not (<= |old(~token~0)| |old(~local~0)|)) .cse12 (and .cse6 .cse40 .cse41 .cse42 .cse23 .cse43 .cse8 .cse9 .cse44 .cse45) .cse15 .cse14 .cse30 .cse16 .cse17 .cse35 .cse20 .cse21 .cse26 .cse46 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse33 .cse47 .cse18 .cse19 .cse48 .cse49 .cse25 .cse50 .cse27 .cse28 .cse32) (or .cse0 .cse1 .cse12 .cse14 .cse15 .cse30 .cse16 .cse17 .cse20 .cse21 (and .cse5 .cse51 .cse22 .cse7 .cse52 .cse9 .cse53) .cse31 .cse29 .cse2 .cse38 .cse33 .cse34 .cse18 .cse19 .cse48 .cse25 .cse28 .cse32) (or .cse0 .cse1 .cse12 .cse14 .cse15 .cse16 .cse30 .cse17 .cse35 .cse36 .cse20 .cse21 .cse31 (and .cse5 .cse6 .cse22 .cse42 .cse52 .cse9 .cse53) .cse2 .cse33 .cse34 .cse18 .cse19 .cse48 .cse25 (and .cse5 .cse51 .cse22 .cse52 .cse9 .cse54 .cse53) .cse37 .cse28 .cse55 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse34 .cse56 .cse15 (and .cse6 .cse22 .cse23 .cse8 .cse7 .cse9 .cse10 .cse11) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse7 .cse21 .cse24 .cse25 .cse28 .cse31 .cse29) (or .cse0 .cse1 .cse12 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse31 .cse29 .cse2 (and .cse5 .cse6 .cse22 .cse7 .cse52 .cse9 .cse53) .cse3 .cse34 .cse18 .cse19 .cse48 .cse24 .cse25 .cse37 .cse28 .cse55 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse28 .cse31 .cse32) (let ((.cse58 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse4 .cse12 .cse13 .cse15 .cse16 .cse17 (and .cse40 .cse43 .cse57) .cse20 .cse21 .cse26 .cse29 .cse2 (not (<= |old(~token~0)| .cse58)) .cse3 .cse56 .cse18 .cse59 .cse19 .cse24 .cse25 .cse27 .cse28 (not (<= .cse58 |old(~token~0)|)) (and (and .cse40 .cse43 (and .cse6 .cse41 .cse42 .cse23 .cse8 .cse9)) .cse44 .cse45))) (or .cse0 .cse1 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse41 .cse26 .cse29 .cse2 .cse3 .cse18 .cse59 .cse19 .cse24 .cse25 .cse27 .cse28) (or .cse0 .cse1 .cse39 .cse4 .cse12 .cse14 .cse15 .cse30 .cse16 .cse17 .cse35 .cse20 .cse21 .cse26 .cse46 .cse2 .cse33 .cse47 .cse18 .cse19 .cse48 .cse49 .cse50 .cse25 .cse27 .cse28 .cse32) (or .cse0 .cse1 .cse4 .cse12 .cse13 .cse15 .cse16 .cse17 .cse20 .cse21 .cse26 .cse29 .cse2 .cse3 .cse34 .cse56 .cse18 .cse59 .cse19 .cse24 .cse25 .cse27 .cse28 .cse57))))) [2019-10-02 16:25:30,745 INFO L439 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: (let ((.cse12 (= ~T1_E~0 1)) (.cse5 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= 1 ~M_E~0)) (.cse46 (= 0 ~t1_st~0)) (.cse24 (= 1 ~t3_pc~0)) (.cse21 (= 1 ~t1_pc~0))) (let ((.cse40 (not .cse21)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~m_st~0 0)) (.cse42 (not (= ~m_pc~0 1))) (.cse30 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse86 (not .cse24)) (.cse55 (= 1 ~t2_pc~0)) (.cse22 (<= 2 ~t3_st~0)) (.cse45 (not .cse46)) (.cse25 (<= 2 ~m_st~0)) (.cse85 (= ~t1_i~0 1)) (.cse26 (and (not .cse12) (not .cse5) (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse10) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse27 (not (= eval_~tmp~0 0)))) (let ((.cse77 (and .cse21 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse27)) (.cse64 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse27)) (.cse74 (and .cse30 .cse21 .cse55 .cse86 .cse45 .cse25 .cse85 .cse26 .cse27)) (.cse81 (and .cse30 .cse40 .cse86 .cse23 .cse41 .cse85 .cse26 .cse46 .cse42)) (.cse62 (<= ~t2_pc~0 0)) (.cse78 (and .cse30 .cse21 .cse86 .cse45 .cse25 .cse26 .cse27)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (<= |old(~E_2~0)| ~E_2~0)) (.cse34 (= |old(~t1_pc~0)| 1)) (.cse87 (+ ~local~0 1)) (.cse88 (+ ~local~0 2)) (.cse89 (+ ~local~0 3)) (.cse53 (not (= 0 ~t2_st~0))) (.cse54 (<= 2 ~E_2~0)) (.cse63 (= eval_~tmp~0 1)) (.cse65 (<= ~token~0 ~local~0)) (.cse66 (<= ~local~0 ~token~0)) (.cse7 (= 1 |old(~t3_pc~0)|))) (let ((.cse39 (and .cse30 .cse40 .cse86 .cse22 .cse23 .cse45 .cse25 .cse26)) (.cse37 (and .cse30 .cse40 .cse86 .cse22 .cse23 .cse25 .cse26 .cse46)) (.cse44 (not .cse7)) (.cse48 (or (and .cse21 .cse55 .cse22 .cse23 .cse45 .cse24 .cse25 .cse85 .cse26 .cse7) (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse7 .cse27))) (.cse49 (not (= 1 |old(~t2_pc~0)|))) (.cse58 (and (and .cse21 .cse53 .cse55 .cse22 .cse24 .cse54 .cse25 .cse26 .cse63) .cse65 .cse66)) (.cse50 (<= .cse89 ~token~0)) (.cse52 (<= ~token~0 .cse89)) (.cse51 (and .cse53 .cse54 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse41 .cse26 .cse27))) (.cse56 (<= .cse88 ~token~0)) (.cse57 (<= ~token~0 .cse88)) (.cse60 (<= ~token~0 .cse87)) (.cse61 (<= .cse87 ~token~0)) (.cse35 (not (<= 2 |old(~t3_st~0)|))) (.cse38 (and .cse30 .cse21 .cse86 .cse22 .cse45 .cse25 .cse26)) (.cse47 (and .cse30 .cse21 .cse86 .cse22 .cse25 .cse26 .cse46)) (.cse3 (not .cse34)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse21 .cse25 .cse26 .cse42)) (.cse32 (= 0 |old(~E_2~0)|)) (.cse79 (and .cse30 .cse40 .cse25 .cse46 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse1 (= ~T2_E~0 1)) (.cse80 (not (<= |old(~t2_pc~0)| 0))) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse31 (and .cse25 .cse26 .cse42)) (.cse9 (= 0 ~M_E~0)) (.cse36 (not .cse20)) (.cse67 (and .cse53 .cse54 .cse78 .cse28)) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse82 (and .cse40 .cse22 .cse24 .cse41 .cse46 .cse62 .cse42 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse17 (not (= 1 ~t1_i~0))) (.cse69 (and .cse21 .cse22 .cse45 .cse24 .cse41 .cse85 .cse62 .cse42 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse70 (and .cse21 .cse22 .cse24 .cse25 .cse85 .cse62 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse71 (and .cse53 .cse81 .cse62 .cse28 .cse29)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse72 (and .cse30 .cse21 .cse86 .cse25 .cse85 .cse46 .cse62 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse73 (and .cse53 .cse54 .cse74)) (.cse83 (and .cse30 .cse21 .cse86 .cse45 .cse41 .cse85 .cse62 .cse42 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse84 (and .cse53 .cse54 .cse64)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse43 (not (= 0 |old(~m_st~0)|))) (.cse75 (and .cse53 .cse54 .cse77 .cse28)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse76 (and .cse40 .cse22 .cse24 .cse25 .cse85 .cse46 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse18 (not (<= 2 |old(~E_2~0)|))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse33 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse29) (and (and .cse30 .cse21 .cse23 .cse25 .cse26) .cse28 .cse29)) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19 .cse32 .cse33) (or .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse35 .cse7 .cse8 .cse31 .cse9 .cse10 .cse36 .cse37 .cse11 .cse12 .cse13 .cse14 .cse16 .cse38 .cse19 .cse32) (or .cse0 .cse1 .cse2 .cse39 .cse5 .cse34 .cse6 .cse35 .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19 .cse32 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse32 (and .cse30 .cse21 .cse22 .cse25 .cse26)) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse31 .cse9 .cse10 .cse13 .cse14 (and .cse30 .cse40 .cse22 .cse23 .cse41 .cse26 .cse42) .cse32 .cse20 .cse2 .cse39 .cse34 .cse35 .cse11 .cse12 .cse43 .cse16 .cse19 .cse33) (or (and (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse28 .cse29) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse44 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 .cse31 .cse10 .cse36 .cse37 .cse13 .cse14 .cse32 (and .cse30 .cse21 .cse22 .cse45 .cse41 .cse26 .cse42) .cse2 .cse34 .cse35 .cse11 .cse12 .cse43 .cse16 (and .cse30 .cse40 .cse22 .cse41 .cse26 .cse46 .cse42) .cse38 .cse19 .cse47 .cse33) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse17 .cse20 .cse48 .cse2 .cse3 .cse35 .cse44 .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19) (let ((.cse59 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (and .cse50 .cse51 .cse52) .cse13 (and .cse53 .cse54 .cse48) .cse14 .cse17 (and .cse55 (and .cse53 .cse54 (or (and .cse21 .cse23 .cse24 .cse25 .cse26) (and .cse21 .cse45 .cse24 .cse25 .cse26 .cse27))) .cse56 .cse57) .cse20 .cse2 .cse58 (not (<= |old(~token~0)| .cse59)) .cse3 .cse44 (and .cse60 .cse54 .cse61 .cse48) .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19 (not (<= .cse59 |old(~token~0)|)))) (or .cse0 .cse1 .cse4 .cse5 .cse55 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse17 .cse20 .cse2 .cse3 .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse19 .cse32 .cse20) (let ((.cse68 (= |old(~token~0)| ~token~0))) (or (and .cse40 .cse22 .cse24 .cse25 .cse62 .cse23 .cse26 .cse63 .cse28 .cse29) .cse0 .cse58 (and .cse60 (and .cse54 .cse64) .cse61) (and (and .cse30 .cse53 .cse55 .cse25 .cse26 .cse46 .cse63 .cse29) .cse65 .cse66) .cse31 .cse9 .cse10 .cse36 .cse67 .cse13 (and .cse55 .cse65 (and .cse40 .cse22 .cse24 .cse41 .cse42 .cse53 .cse23 .cse26 .cse63 .cse29) .cse66 .cse68) (and .cse50 .cse52 .cse51) .cse69 .cse70 (and .cse65 .cse66 .cse68 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse41 .cse42 .cse53 .cse54 .cse26 .cse63)) .cse71 (and .cse53 .cse54 .cse56 (and .cse21 .cse55 .cse45 .cse24 .cse25 .cse26 .cse27) .cse57) .cse72 .cse73 (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse22 .cse24 .cse25 .cse46 .cse62 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) .cse34 (and .cse60 (and .cse54 .cse74) .cse61) (and .cse21 .cse22 .cse45 .cse24 .cse41 .cse62 .cse42 .cse68 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) .cse11 .cse75 .cse16 .cse76 (and .cse54 .cse77 .cse62 .cse28) .cse19 (and .cse54 .cse78 .cse62 .cse28) (and .cse55 .cse40 .cse22 .cse24 .cse25 .cse53 .cse23 .cse26 .cse63 .cse29) .cse79 .cse1 .cse80 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse8 .cse7 (and .cse81 .cse65 .cse62 .cse66 .cse28 .cse68 .cse29) .cse14 .cse82 .cse17 (and .cse30 .cse21 .cse45 .cse41 .cse62 .cse42 .cse68 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse30 .cse25 .cse46 .cse62 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse55 .cse65 (and .cse53 .cse81 .cse29) .cse66 .cse68) (and (and .cse30 .cse21 .cse55 .cse45 .cse41 .cse42 .cse53 .cse26 .cse63 .cse29) .cse65 .cse66 .cse68) .cse2 .cse83 .cse84 .cse12 .cse43 (and .cse40 .cse22 .cse24 .cse41 .cse62 .cse42 .cse68 .cse23 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse30 .cse55 .cse40 .cse25 .cse53 .cse23 .cse26 .cse63 .cse29) .cse18 (and .cse30 .cse40 .cse25 .cse62 .cse23 .cse26 .cse63 .cse28 .cse29) .cse33)) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse32 .cse20 .cse2 (and .cse30 .cse21 .cse22 .cse23 .cse41 .cse26 .cse42) .cse3 .cse35 .cse11 .cse12 .cse43 .cse15 .cse16 .cse38 .cse19 .cse47 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse32 .cse33) (or .cse0 .cse79 .cse1 .cse80 .cse4 .cse5 .cse7 .cse8 .cse31 .cse9 .cse10 .cse36 .cse67 .cse13 .cse14 .cse82 .cse17 .cse69 .cse70 .cse71 .cse2 .cse72 .cse73 .cse83 .cse34 .cse84 .cse11 .cse12 .cse43 .cse75 .cse16 .cse76 .cse18 .cse19 .cse33)))))) [2019-10-02 16:25:30,746 INFO L439 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse10 (= ~T1_E~0 1)) (.cse3 (= ~T3_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~M_E~0)) (.cse35 (= 1 ~t3_pc~0)) (.cse55 (= 1 ~t1_pc~0))) (let ((.cse26 (= |old(~t1_pc~0)| 1)) (.cse22 (= ~m_st~0 0)) (.cse44 (<= ~t2_pc~0 0)) (.cse24 (not (= ~m_pc~0 1))) (.cse32 (= |old(~t1_st~0)| 0)) (.cse34 (= 1 ~t2_pc~0)) (.cse56 (<= 2 ~E_2~0)) (.cse36 (not (= 0 ~t2_st~0))) (.cse59 (= ~t1_i~0 1)) (.cse37 (= eval_~tmp~0 1)) (.cse45 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (<= |old(~E_2~0)| ~E_2~0)) (.cse18 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse19 (not .cse55)) (.cse58 (not .cse35)) (.cse20 (<= 2 ~t3_st~0)) (.cse21 (not (= 0 ~t1_st~0))) (.cse43 (<= 2 ~m_st~0)) (.cse23 (and (not .cse10) (not .cse3) (not .cse5) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse8) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))))) (let ((.cse25 (and .cse18 .cse19 .cse58 .cse20 .cse21 .cse43 .cse23)) (.cse33 (not (<= |old(~t2_pc~0)| 0))) (.cse51 (or (and .cse55 .cse36 .cse34 .cse20 .cse21 .cse35 .cse56 .cse43 .cse59 .cse23 .cse37) (and .cse36 .cse20 .cse21 .cse35 .cse43 .cse59 .cse23 .cse37 .cse45 .cse38))) (.cse46 (not .cse32)) (.cse47 (and .cse18 .cse36 .cse19 .cse58 .cse21 .cse43 .cse23 .cse37 .cse45 .cse38)) (.cse49 (and .cse18 .cse19 .cse58 .cse21 .cse22 .cse59 .cse44 .cse24 .cse36 .cse23 .cse37 .cse45 .cse38)) (.cse50 (and .cse19 .cse20 .cse21 .cse35 .cse22 .cse59 .cse44 .cse24 .cse36 .cse23 .cse37 .cse45 .cse38)) (.cse52 (and .cse36 .cse19 .cse20 .cse21 .cse35 .cse43 .cse59 .cse23 .cse37 .cse45 .cse38)) (.cse42 (or (and .cse18 .cse55 .cse36 .cse58 .cse21 .cse43 .cse59 .cse23 .cse37 .cse45 .cse38) (and .cse18 .cse55 .cse36 .cse34 .cse58 .cse21 .cse43 .cse59 .cse23 .cse37 .cse38))) (.cse29 (and .cse18 .cse55 .cse58 .cse20 .cse21 .cse43 .cse23)) (.cse17 (= 1 |old(~t3_pc~0)|)) (.cse6 (and .cse43 .cse23 .cse24)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse15 (= 0 |old(~E_2~0)|)) (.cse16 (= 1 |old(~m_pc~0)|)) (.cse39 (<= ~token~0 ~local~0)) (.cse40 (<= ~local~0 ~token~0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse30 (not .cse26)) (.cse54 (= 0 |old(~t2_st~0)|)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse27 (not (<= 2 |old(~t3_st~0)|))) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse31 (and .cse55 .cse43 .cse23 .cse24)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse48 (not (= 1 ~t1_i~0))) (.cse53 (not (<= 2 |old(~E_2~0)|))) (.cse14 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse17 .cse5 .cse7 .cse6 .cse8 .cse11 .cse12 .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse2 .cse26 .cse27 .cse9 .cse10 .cse28 .cse13 .cse29 .cse14 .cse16) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse26 .cse4 .cse27 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse27 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse31 .cse13 .cse29 .cse14 .cse15 .cse32 .cse16) (let ((.cse41 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse33 (and (and .cse34 .cse19 .cse20 .cse21 .cse35 .cse22 .cse24 .cse36 .cse23 .cse37 .cse38) .cse39 .cse40 .cse41) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse42 .cse39 .cse40) .cse3 (and .cse18 .cse36 .cse34 .cse19 .cse21 .cse43 .cse23 .cse37 .cse38) .cse5 .cse17 .cse6 .cse7 (and .cse18 .cse21 .cse43 .cse23 .cse37 .cse44 .cse45 .cse38) .cse8 .cse46 (and .cse19 .cse20 .cse21 .cse35 .cse22 .cse44 .cse24 .cse41 .cse39 .cse23 .cse37 .cse40 .cse45 .cse38) .cse11 (and .cse36 .cse34 .cse19 .cse20 .cse21 .cse35 .cse43 .cse23 .cse37 .cse38) .cse12 .cse47 .cse48 .cse49 .cse50 (and (and .cse18 .cse34 .cse19 .cse21 .cse22 .cse24 .cse36 .cse23 .cse37 .cse38) .cse39 .cse40 .cse41) .cse2 (and .cse51 .cse39 .cse40) (not (<= |old(~local~0)| |old(~token~0)|)) .cse52 .cse26 (and .cse20 .cse21 .cse35 .cse43 .cse23 .cse37 .cse44 .cse45 .cse38) .cse9 .cse10 .cse28 .cse13 .cse53 .cse14 (and .cse18 .cse19 .cse21 .cse22 .cse44 .cse24 .cse41 .cse39 .cse23 .cse37 .cse40 .cse45 .cse38) .cse16)) (or .cse0 .cse1 .cse2 .cse30 .cse54 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse48 .cse53 .cse14 .cse32) (or .cse0 .cse1 .cse33 .cse54 .cse3 .cse17 .cse5 .cse6 .cse7 (and .cse51 .cse44) .cse8 .cse46 .cse11 .cse12 .cse47 .cse48 .cse49 .cse50 .cse2 .cse52 .cse26 (and .cse42 .cse44) .cse9 .cse10 .cse28 .cse13 .cse53 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse4 .cse27 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse29 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse17 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32) (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse27 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16) (let ((.cse57 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse54 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 .cse48 .cse32 .cse2 (and .cse39 (and .cse55 .cse36 .cse34 .cse20 .cse21 .cse35 .cse56 .cse43 .cse23 .cse37) .cse40) (not (<= |old(~token~0)| .cse57)) .cse30 .cse9 (not (= 1 |old(~t2_pc~0)|)) .cse10 .cse31 .cse13 .cse53 .cse14 (not (<= .cse57 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse30 .cse54 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse48 .cse53 .cse14 .cse32))))) [2019-10-02 16:25:30,746 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 404) no Hoare annotation was computed. [2019-10-02 16:25:30,746 INFO L443 ceAbstractionStarter]: For program point L352(lines 342 408) no Hoare annotation was computed. [2019-10-02 16:25:30,746 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 376) no Hoare annotation was computed. [2019-10-02 16:25:30,748 INFO L439 ceAbstractionStarter]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse12 (= ~T1_E~0 1)) (.cse5 (= ~T3_E~0 1)) (.cse8 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= 1 ~M_E~0)) (.cse46 (= 0 ~t1_st~0)) (.cse24 (= 1 ~t3_pc~0)) (.cse21 (= 1 ~t1_pc~0))) (let ((.cse40 (not .cse21)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~m_st~0 0)) (.cse42 (not (= ~m_pc~0 1))) (.cse30 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse86 (not .cse24)) (.cse55 (= 1 ~t2_pc~0)) (.cse22 (<= 2 ~t3_st~0)) (.cse45 (not .cse46)) (.cse25 (<= 2 ~m_st~0)) (.cse85 (= ~t1_i~0 1)) (.cse26 (and (not .cse12) (not .cse5) (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse10) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse27 (not (= eval_~tmp~0 0)))) (let ((.cse77 (and .cse21 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse27)) (.cse64 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse27)) (.cse74 (and .cse30 .cse21 .cse55 .cse86 .cse45 .cse25 .cse85 .cse26 .cse27)) (.cse81 (and .cse30 .cse40 .cse86 .cse23 .cse41 .cse85 .cse26 .cse46 .cse42)) (.cse62 (<= ~t2_pc~0 0)) (.cse78 (and .cse30 .cse21 .cse86 .cse45 .cse25 .cse26 .cse27)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~t2_st~0)| ~t2_st~0)) (.cse29 (<= |old(~E_2~0)| ~E_2~0)) (.cse34 (= |old(~t1_pc~0)| 1)) (.cse87 (+ ~local~0 1)) (.cse88 (+ ~local~0 2)) (.cse89 (+ ~local~0 3)) (.cse53 (not (= 0 ~t2_st~0))) (.cse54 (<= 2 ~E_2~0)) (.cse63 (= eval_~tmp~0 1)) (.cse65 (<= ~token~0 ~local~0)) (.cse66 (<= ~local~0 ~token~0)) (.cse7 (= 1 |old(~t3_pc~0)|))) (let ((.cse39 (and .cse30 .cse40 .cse86 .cse22 .cse23 .cse45 .cse25 .cse26)) (.cse37 (and .cse30 .cse40 .cse86 .cse22 .cse23 .cse25 .cse26 .cse46)) (.cse44 (not .cse7)) (.cse48 (or (and .cse21 .cse55 .cse22 .cse23 .cse45 .cse24 .cse25 .cse85 .cse26 .cse7) (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse25 .cse85 .cse26 .cse7 .cse27))) (.cse49 (not (= 1 |old(~t2_pc~0)|))) (.cse58 (and (and .cse21 .cse53 .cse55 .cse22 .cse24 .cse54 .cse25 .cse26 .cse63) .cse65 .cse66)) (.cse50 (<= .cse89 ~token~0)) (.cse52 (<= ~token~0 .cse89)) (.cse51 (and .cse53 .cse54 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse41 .cse26 .cse27))) (.cse56 (<= .cse88 ~token~0)) (.cse57 (<= ~token~0 .cse88)) (.cse60 (<= ~token~0 .cse87)) (.cse61 (<= .cse87 ~token~0)) (.cse35 (not (<= 2 |old(~t3_st~0)|))) (.cse38 (and .cse30 .cse21 .cse86 .cse22 .cse45 .cse25 .cse26)) (.cse47 (and .cse30 .cse21 .cse86 .cse22 .cse25 .cse26 .cse46)) (.cse3 (not .cse34)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse15 (and .cse21 .cse25 .cse26 .cse42)) (.cse32 (= 0 |old(~E_2~0)|)) (.cse79 (and .cse30 .cse40 .cse25 .cse46 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse1 (= ~T2_E~0 1)) (.cse80 (not (<= |old(~t2_pc~0)| 0))) (.cse4 (= 0 |old(~t2_st~0)|)) (.cse31 (and .cse25 .cse26 .cse42)) (.cse9 (= 0 ~M_E~0)) (.cse36 (not .cse20)) (.cse67 (and .cse53 .cse54 .cse78 .cse28)) (.cse13 (= 1 |old(~E_3~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse82 (and .cse40 .cse22 .cse24 .cse41 .cse46 .cse62 .cse42 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse17 (not (= 1 ~t1_i~0))) (.cse69 (and .cse21 .cse22 .cse45 .cse24 .cse41 .cse85 .cse62 .cse42 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse70 (and .cse21 .cse22 .cse24 .cse25 .cse85 .cse62 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse71 (and .cse53 .cse81 .cse62 .cse28 .cse29)) (.cse2 (= 0 |old(~E_3~0)|)) (.cse72 (and .cse30 .cse21 .cse86 .cse25 .cse85 .cse46 .cse62 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse73 (and .cse53 .cse54 .cse74)) (.cse83 (and .cse30 .cse21 .cse86 .cse45 .cse41 .cse85 .cse62 .cse42 .cse53 .cse26 .cse63 .cse28 .cse29)) (.cse84 (and .cse53 .cse54 .cse64)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse43 (not (= 0 |old(~m_st~0)|))) (.cse75 (and .cse53 .cse54 .cse77 .cse28)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse76 (and .cse40 .cse22 .cse24 .cse25 .cse85 .cse46 .cse53 .cse23 .cse26 .cse63 .cse28 .cse29)) (.cse18 (not (<= 2 |old(~E_2~0)|))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse33 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse29) (and (and .cse30 .cse21 .cse23 .cse25 .cse26) .cse28 .cse29)) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19 .cse32 .cse33) (or .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse35 .cse7 .cse8 .cse31 .cse9 .cse10 .cse36 .cse37 .cse11 .cse12 .cse13 .cse14 .cse16 .cse38 .cse19 .cse32) (or .cse0 .cse1 .cse2 .cse39 .cse5 .cse34 .cse6 .cse35 .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19 .cse32 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse32 (and .cse30 .cse21 .cse22 .cse25 .cse26)) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse31 .cse9 .cse10 .cse13 .cse14 (and .cse30 .cse40 .cse22 .cse23 .cse41 .cse26 .cse42) .cse32 .cse20 .cse2 .cse39 .cse34 .cse35 .cse11 .cse12 .cse43 .cse16 .cse19 .cse33) (or (and (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse28 .cse29) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse35 .cse44 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 .cse31 .cse10 .cse36 .cse37 .cse13 .cse14 .cse32 (and .cse30 .cse21 .cse22 .cse45 .cse41 .cse26 .cse42) .cse2 .cse34 .cse35 .cse11 .cse12 .cse43 .cse16 (and .cse30 .cse40 .cse22 .cse41 .cse26 .cse46 .cse42) .cse38 .cse19 .cse47 .cse33) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse17 .cse20 .cse48 .cse2 .cse3 .cse35 .cse44 .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19) (let ((.cse59 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (and .cse50 .cse51 .cse52) .cse13 (and .cse53 .cse54 .cse48) .cse14 .cse17 (and .cse55 (and .cse53 .cse54 (or (and .cse21 .cse23 .cse24 .cse25 .cse26) (and .cse21 .cse45 .cse24 .cse25 .cse26 .cse27))) .cse56 .cse57) .cse20 .cse2 .cse58 (not (<= |old(~token~0)| .cse59)) .cse3 .cse44 (and .cse60 .cse54 .cse61 .cse48) .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19 (not (<= .cse59 |old(~token~0)|)))) (or .cse0 .cse1 .cse4 .cse5 .cse55 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse17 .cse20 .cse2 .cse3 .cse11 .cse49 .cse12 .cse15 .cse16 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse19 .cse32 .cse20) (let ((.cse68 (= |old(~token~0)| ~token~0))) (or (and .cse40 .cse22 .cse24 .cse25 .cse62 .cse23 .cse26 .cse63 .cse28 .cse29) .cse0 .cse58 (and .cse60 (and .cse54 .cse64) .cse61) (and (and .cse30 .cse53 .cse55 .cse25 .cse26 .cse46 .cse63 .cse29) .cse65 .cse66) .cse31 .cse9 .cse10 .cse36 .cse67 .cse13 (and .cse55 .cse65 (and .cse40 .cse22 .cse24 .cse41 .cse42 .cse53 .cse23 .cse26 .cse63 .cse29) .cse66 .cse68) (and .cse50 .cse52 .cse51) .cse69 .cse70 (and .cse65 .cse66 .cse68 (and .cse21 .cse55 .cse22 .cse45 .cse24 .cse41 .cse42 .cse53 .cse54 .cse26 .cse63)) .cse71 (and .cse53 .cse54 .cse56 (and .cse21 .cse55 .cse45 .cse24 .cse25 .cse26 .cse27) .cse57) .cse72 .cse73 (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse22 .cse24 .cse25 .cse46 .cse62 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) .cse34 (and .cse60 (and .cse54 .cse74) .cse61) (and .cse21 .cse22 .cse45 .cse24 .cse41 .cse62 .cse42 .cse68 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) .cse11 .cse75 .cse16 .cse76 (and .cse54 .cse77 .cse62 .cse28) .cse19 (and .cse54 .cse78 .cse62 .cse28) (and .cse55 .cse40 .cse22 .cse24 .cse25 .cse53 .cse23 .cse26 .cse63 .cse29) .cse79 .cse1 .cse80 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse8 .cse7 (and .cse81 .cse65 .cse62 .cse66 .cse28 .cse68 .cse29) .cse14 .cse82 .cse17 (and .cse30 .cse21 .cse45 .cse41 .cse62 .cse42 .cse68 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse30 .cse25 .cse46 .cse62 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse55 .cse65 (and .cse53 .cse81 .cse29) .cse66 .cse68) (and (and .cse30 .cse21 .cse55 .cse45 .cse41 .cse42 .cse53 .cse26 .cse63 .cse29) .cse65 .cse66 .cse68) .cse2 .cse83 .cse84 .cse12 .cse43 (and .cse40 .cse22 .cse24 .cse41 .cse62 .cse42 .cse68 .cse23 .cse65 .cse26 .cse63 .cse66 .cse28 .cse29) (and .cse30 .cse55 .cse40 .cse25 .cse53 .cse23 .cse26 .cse63 .cse29) .cse18 (and .cse30 .cse40 .cse25 .cse62 .cse23 .cse26 .cse63 .cse28 .cse29) .cse33)) (or .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse32 .cse20 .cse2 (and .cse30 .cse21 .cse22 .cse23 .cse41 .cse26 .cse42) .cse3 .cse35 .cse11 .cse12 .cse43 .cse15 .cse16 .cse38 .cse19 .cse47 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse32 .cse33) (or .cse0 .cse79 .cse1 .cse80 .cse4 .cse5 .cse7 .cse8 .cse31 .cse9 .cse10 .cse36 .cse67 .cse13 .cse14 .cse82 .cse17 .cse69 .cse70 .cse71 .cse2 .cse72 .cse73 .cse83 .cse34 .cse84 .cse11 .cse12 .cse43 .cse75 .cse16 .cse76 .cse18 .cse19 .cse33)))))) [2019-10-02 16:25:30,749 INFO L439 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse26 (= ~T1_E~0 1)) (.cse4 (= ~T3_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse9 (= 1 ~M_E~0)) (.cse49 (= 0 ~t1_st~0)) (.cse39 (= 1 ~t3_pc~0)) (.cse18 (= 1 ~t1_pc~0))) (let ((.cse24 (= |old(~t1_pc~0)| 1)) (.cse54 (= |old(~t1_st~0)| 0)) (.cse42 (not (= ~m_pc~0 1))) (.cse17 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse37 (not .cse18)) (.cse59 (not .cse39)) (.cse38 (<= 2 ~t3_st~0)) (.cse44 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (not .cse49)) (.cse21 (<= 2 ~m_st~0)) (.cse22 (and (not .cse26) (not .cse4) (not .cse6) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse0) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not .cse9) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse60 (+ ~local~0 1))) (let ((.cse2 (not (<= |old(~t2_pc~0)| 0))) (.cse15 (not (= 0 ~t2_st~0))) (.cse50 (<= ~token~0 .cse60)) (.cse19 (= 1 ~t2_pc~0)) (.cse23 (not (= eval_~tmp~0 0))) (.cse16 (<= 2 ~E_2~0)) (.cse51 (<= .cse60 ~token~0)) (.cse53 (and .cse17 .cse37 .cse59 .cse38 .cse44 .cse20 .cse21 .cse22)) (.cse7 (and .cse21 .cse22 .cse42)) (.cse10 (not .cse54)) (.cse35 (and .cse17 .cse37 .cse59 .cse38 .cse44 .cse21 .cse22 .cse49)) (.cse5 (= 1 |old(~t3_pc~0)|)) (.cse40 (= ~m_st~0 0)) (.cse27 (not (= 0 |old(~m_st~0)|))) (.cse36 (and .cse17 .cse18 .cse59 .cse38 .cse20 .cse21 .cse22)) (.cse58 (and .cse17 .cse18 .cse59 .cse38 .cse21 .cse22 .cse49)) (.cse33 (= 0 |old(~E_2~0)|)) (.cse31 (= 1 |old(~m_pc~0)|)) (.cse1 (= ~T2_E~0 1)) (.cse14 (= 0 |old(~E_3~0)|)) (.cse55 (not .cse24)) (.cse3 (= 0 |old(~t2_st~0)|)) (.cse32 (not (<= 2 |old(~m_st~0)|))) (.cse34 (not (<= 2 |old(~t3_st~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse25 (= 1 |old(~E_M~0)|)) (.cse11 (= 1 |old(~E_3~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse56 (and .cse18 .cse21 .cse22 .cse42)) (.cse28 (= 0 |old(~E_1~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse29 (not (<= 2 |old(~E_2~0)|))) (.cse30 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (or .cse0 .cse1 .cse14 .cse4 .cse32 .cse6 .cse7 .cse8 .cse9 .cse25 .cse26 .cse11 .cse12 .cse28 .cse30 .cse33 .cse31) (or .cse0 .cse1 .cse14 .cse4 .cse24 .cse32 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse35 .cse25 .cse26 .cse11 .cse12 .cse28 .cse36 .cse30 .cse33) (let ((.cse52 (and .cse15 .cse16 (and .cse18 .cse38 .cse20 .cse39 .cse21 (= ~t1_i~0 1) .cse22 .cse23))) (.cse41 (<= ~t2_pc~0 0)) (.cse43 (= |old(~token~0)| ~token~0)) (.cse45 (<= ~token~0 ~local~0)) (.cse46 (= eval_~tmp~0 1)) (.cse47 (<= ~local~0 ~token~0)) (.cse48 (<= |old(~E_2~0)| ~E_2~0))) (or .cse0 .cse1 .cse2 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse15 .cse44 .cse45 .cse22 .cse46 .cse47 .cse48) (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 (and (and .cse15 .cse37 .cse38 .cse39 .cse21 .cse22 .cse49 .cse46 .cse48) .cse41) .cse6 .cse5 .cse7 .cse8 (and .cse17 .cse15 .cse37 .cse21 .cse22 .cse49 .cse46 .cse48) .cse9 .cse10 .cse11 .cse12 (and .cse38 .cse39 .cse21 .cse49 .cse41 .cse15 .cse45 .cse22 .cse46 .cse47 .cse48) .cse13 (and .cse50 .cse19 .cse51 .cse52) .cse14 (and .cse17 .cse18 .cse20 .cse40 .cse41 .cse42 .cse43 .cse15 .cse45 .cse22 .cse46 .cse47 .cse48) (not (<= |old(~local~0)| |old(~token~0)|)) .cse24 .cse25 .cse26 .cse27 (and .cse18 .cse38 .cse20 .cse39 .cse40 .cse41 .cse42 .cse43 .cse15 .cse45 .cse22 .cse46 .cse47 .cse48) (and .cse17 .cse21 .cse49 .cse41 .cse15 .cse45 .cse22 .cse46 .cse47 .cse48) (and .cse52 .cse41) .cse28 (and .cse15 .cse16 (and .cse17 .cse18 .cse20 .cse21 .cse22 .cse23)) .cse29 .cse30 (and .cse17 .cse37 .cse40 .cse41 .cse42 .cse43 .cse15 .cse44 .cse45 .cse22 .cse46 .cse47 .cse48) .cse31)) (or .cse0 .cse1 .cse14 .cse53 .cse4 .cse24 .cse32 .cse34 .cse5 .cse6 .cse8 .cse7 .cse9 .cse25 .cse26 .cse11 .cse12 .cse28 .cse30 .cse33 .cse54) (or .cse0 .cse1 .cse14 .cse55 .cse4 .cse32 .cse34 .cse5 .cse6 .cse8 .cse9 .cse25 .cse26 .cse11 .cse12 .cse56 .cse28 .cse30 .cse33 (and .cse17 .cse18 .cse38 .cse21 .cse22)) (let ((.cse57 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse3 .cse4 .cse32 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse54 (and .cse15 .cse50 (and .cse18 .cse19 .cse38 .cse20 .cse39 .cse21 .cse22 .cse23) .cse16 .cse51) .cse14 (not (<= |old(~token~0)| .cse57)) .cse55 .cse25 (not (= 1 |old(~t2_pc~0)|)) .cse26 .cse56 .cse28 .cse29 .cse30 (not (<= .cse57 |old(~token~0)|)))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (and .cse17 .cse37 .cse38 .cse44 .cse40 .cse22 .cse42) .cse33 .cse54 .cse14 .cse53 .cse24 .cse34 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse35 .cse11 .cse12 .cse33 (and .cse17 .cse18 .cse38 .cse20 .cse40 .cse22 .cse42) .cse14 .cse24 .cse34 .cse25 .cse26 .cse27 .cse28 (and .cse17 .cse37 .cse38 .cse40 .cse22 .cse49 .cse42) .cse36 .cse30 .cse58 .cse31) (or .cse0 .cse1 .cse14 .cse55 .cse4 .cse32 .cse34 .cse5 .cse6 .cse8 .cse9 .cse25 .cse26 .cse11 .cse44 .cse12 .cse56 .cse28 .cse30 .cse33 .cse54) (or .cse0 .cse1 .cse14 .cse55 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse9 .cse25 .cse26 .cse11 .cse12 .cse56 .cse28 .cse13 .cse29 .cse30 .cse54) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse33 .cse54 .cse14 (and .cse17 .cse18 .cse38 .cse44 .cse40 .cse22 .cse42) .cse55 .cse34 .cse25 .cse26 .cse27 .cse56 .cse28 .cse36 .cse30 .cse58 .cse31) (or .cse0 .cse1 .cse14 .cse55 .cse4 .cse32 .cse6 .cse8 .cse9 .cse25 .cse26 .cse11 .cse12 .cse56 .cse28 .cse30 .cse33 .cse31) (or .cse0 .cse1 .cse14 .cse55 .cse3 .cse4 .cse32 .cse34 .cse6 .cse8 .cse9 .cse25 .cse26 .cse11 .cse12 .cse56 .cse28 .cse13 .cse29 .cse30 .cse54))))) [2019-10-02 16:25:30,749 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 270 277) no Hoare annotation was computed. [2019-10-02 16:25:30,749 INFO L446 ceAbstractionStarter]: At program point update_channelsFINAL(lines 270 277) the Hoare annotation is: true [2019-10-02 16:25:30,749 INFO L443 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2019-10-02 16:25:30,749 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 704) no Hoare annotation was computed. [2019-10-02 16:25:30,749 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 653 711) no Hoare annotation was computed. [2019-10-02 16:25:30,749 INFO L443 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2019-10-02 16:25:30,750 INFO L439 ceAbstractionStarter]: At program point L663(line 663) the Hoare annotation is: (let ((.cse9 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (<= ~t2_pc~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~E_3~0 |old(~E_3~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~E_2~0 |old(~E_2~0)|)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (and .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse6 .cse8 .cse0 (not (= 0 ~t2_st~0)) .cse12 .cse4 .cse5 .cse7) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (and .cse9 .cse10 .cse1 .cse2 .cse3 .cse6 .cse8 .cse0 (<= 2 ~t3_st~0) .cse4 .cse5 .cse7) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse9 .cse10 .cse11 .cse1 (= |old(~token~0)| ~token~0) .cse2 .cse3 .cse6 (<= ~token~0 ~local~0) .cse8 .cse0 .cse12 .cse4 .cse5 .cse7 (<= ~local~0 ~token~0)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,750 INFO L439 ceAbstractionStarter]: At program point L661(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (= |old(~t3_pc~0)| ~t3_pc~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,750 INFO L439 ceAbstractionStarter]: At program point L661-1(line 661) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (= |old(~t3_pc~0)| ~t3_pc~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,751 INFO L439 ceAbstractionStarter]: At program point L690(line 690) the Hoare annotation is: (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse4 .cse7 .cse11 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 (not .cse5) .cse4 .cse11 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,751 INFO L439 ceAbstractionStarter]: At program point L690-1(line 690) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 0)) (.cse6 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t3_st~0)) (.cse9 (= 1 ~t3_pc~0)) (.cse0 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse7 (= 1 ~t1_pc~0)) (.cse8 (not (= 0 ~t2_st~0))) (.cse4 (not (= 0 ~t1_st~0))) (.cse10 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (and (not (= ~T3_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~T1_E~0 0)) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (and .cse0 .cse1 .cse4 .cse5 .cse3 .cse6) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 (not .cse7) .cse1 .cse5 .cse3 .cse6) (and .cse2 .cse3 .cse6) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (let ((.cse11 (+ ~local~0 2))) (and (and .cse7 .cse8 (= 1 ~t2_pc~0) .cse4 .cse9 .cse10 .cse2 .cse3) (<= .cse11 ~token~0) (<= ~token~0 .cse11))) (= 0 |old(~E_3~0)|) (and .cse7 .cse8 .cse1 .cse4 .cse9 .cse10 .cse2 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse7 .cse8 .cse4 .cse10 .cse2 .cse3) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,751 INFO L439 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse4 .cse7 .cse11 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 (not .cse5) .cse4 .cse11 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,752 INFO L439 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse4 .cse7 .cse11 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 (not .cse5) .cse4 .cse11 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,752 INFO L439 ceAbstractionStarter]: At program point L680-1(line 680) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t3_st~0)) (.cse8 (= 1 ~t3_pc~0)) (.cse0 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse2 (and (not (= 1 ~E_3~0)) (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))))) (.cse7 (not (= 0 ~t1_st~0))) (.cse9 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~m_st~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (let ((.cse4 (+ ~local~0 2))) (and (<= .cse4 ~token~0) (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse2 .cse7 .cse8 .cse9 .cse3) (<= ~token~0 .cse4))) (and .cse2 .cse3 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (and .cse0 (not .cse5) .cse1 .cse2 .cse11 .cse10) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (= 0 |old(~E_3~0)|) (and .cse5 .cse6 .cse1 .cse2 .cse7 .cse8 .cse9 .cse3) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_2~0)|)) (and .cse0 .cse5 .cse6 .cse2 .cse7 .cse9 .cse3) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,753 INFO L439 ceAbstractionStarter]: At program point L676(line 676) the Hoare annotation is: (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse4 .cse7 .cse11 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 (not .cse5) .cse4 .cse11 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,753 INFO L443 ceAbstractionStarter]: For program point L676-1(line 676) no Hoare annotation was computed. [2019-10-02 16:25:30,753 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 653 711) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (= |old(~t3_pc~0)| ~t3_pc~0) (= ~m_st~0 0) (<= ~t2_pc~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t2_st~0)| ~t2_st~0) (not (= 1 ~t1_pc~0)) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,753 INFO L439 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0))) (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (not .cse5)) (.cse12 (= ~m_st~0 0)) (.cse13 (<= ~t2_pc~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (<= |old(~E_2~0)| ~E_2~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse11 .cse12 .cse13 .cse2 (= |old(~token~0)| ~token~0) .cse14 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0) .cse15) (and .cse3 .cse4 .cse7 .cse12 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 .cse11 .cse4 .cse12 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse3 .cse11 .cse12 .cse13 .cse2 .cse6 .cse14 .cse1 .cse15) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:25:30,754 INFO L443 ceAbstractionStarter]: For program point L672-1(line 672) no Hoare annotation was computed. [2019-10-02 16:25:30,754 INFO L439 ceAbstractionStarter]: At program point L668-1(lines 665 705) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0))) (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (not .cse5)) (.cse12 (= ~m_st~0 0)) (.cse13 (<= ~t2_pc~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (<= |old(~E_2~0)| ~E_2~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse11 .cse12 .cse13 .cse2 (= |old(~token~0)| ~token~0) .cse14 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0) .cse15) (and .cse3 .cse4 .cse7 .cse12 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 .cse11 .cse4 .cse12 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse3 .cse11 .cse12 .cse13 .cse2 .cse6 .cse14 .cse1 .cse15) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:25:30,754 INFO L439 ceAbstractionStarter]: At program point L664(line 664) the Hoare annotation is: (let ((.cse9 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse11 (<= ~t2_pc~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~E_3~0 |old(~E_3~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~E_2~0 |old(~E_2~0)|)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (and .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse6 .cse8 .cse0 (not (= 0 ~t2_st~0)) .cse12 .cse4 .cse5 .cse7) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (and .cse9 .cse10 .cse1 .cse2 .cse3 .cse6 .cse8 .cse0 (<= 2 ~t3_st~0) .cse4 .cse5 .cse7) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse9 .cse10 .cse11 .cse1 (= |old(~token~0)| ~token~0) .cse2 .cse3 .cse6 (<= ~token~0 ~local~0) .cse8 .cse0 .cse12 .cse4 .cse5 .cse7 (<= ~local~0 ~token~0)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,755 INFO L439 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: (let ((.cse0 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse1 (= ~m_st~0 0)) (.cse12 (<= ~t2_pc~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T2_E~0)| ~T2_E~0)) (.cse4 (= |old(~T3_E~0)| ~T3_E~0)) (.cse5 (= ~E_3~0 |old(~E_3~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~E_2~0 |old(~E_2~0)|)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|)) (.cse10 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~t3_st~0) .cse9 .cse10 .cse11) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~t2_st~0)) .cse13 .cse9 .cse10 .cse11) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse12 .cse2 (= |old(~token~0)| ~token~0) .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse7 .cse8 .cse13 .cse9 .cse10 .cse11 (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,755 INFO L439 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 0)) (.cse6 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t3_st~0)) (.cse9 (= 1 ~t3_pc~0)) (.cse0 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse7 (= 1 ~t1_pc~0)) (.cse8 (not (= 0 ~t2_st~0))) (.cse4 (not (= 0 ~t1_st~0))) (.cse10 (<= 2 ~E_2~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (and (not (= ~T3_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~T1_E~0 0)) (not (= 1 ~E_3~0)) (not (= 1 ~T2_E~0)) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 0)) (not (= ~E_3~0 0)) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (and .cse0 .cse1 .cse4 .cse5 .cse3 .cse6) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 (not .cse7) .cse1 .cse5 .cse3 .cse6) (and .cse2 .cse3 .cse6) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (let ((.cse11 (+ ~local~0 2))) (and (and .cse7 .cse8 (= 1 ~t2_pc~0) .cse4 .cse9 .cse10 .cse2 .cse3) (<= .cse11 ~token~0) (<= ~token~0 .cse11))) (= 0 |old(~E_3~0)|) (and .cse7 .cse8 .cse1 .cse4 .cse9 .cse10 .cse2 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse7 .cse8 .cse4 .cse10 .cse2 .cse3) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,755 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 696) no Hoare annotation was computed. [2019-10-02 16:25:30,756 INFO L439 ceAbstractionStarter]: At program point L687-1(lines 687 696) the Hoare annotation is: (let ((.cse3 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse4 (<= 2 ~t3_st~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (= 1 ~t3_pc~0)) (.cse9 (<= 2 ~E_2~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and (not (= 1 ~E_3~0)) (and (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (not (= ~T3_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse3 .cse4 .cse0 .cse1) (let ((.cse10 (+ ~local~0 2))) (and (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse7 .cse8 .cse9 .cse0 .cse1) (<= .cse10 ~token~0) (<= ~token~0 .cse10))) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (and .cse3 .cse5 .cse6 .cse7 .cse9 .cse0 .cse1) (not (= 1 ~t1_i~0)) (and .cse3 .cse4 .cse7 .cse11 .cse1 .cse2) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse3 (not .cse5) .cse4 .cse11 .cse1 .cse2) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (and .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse0 .cse1) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,756 INFO L443 ceAbstractionStarter]: For program point L685(line 685) no Hoare annotation was computed. [2019-10-02 16:25:30,756 INFO L439 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse1 (<= 2 ~t3_st~0)) (.cse8 (= 1 ~t3_pc~0)) (.cse0 (= |old(~t3_pc~0)| ~t3_pc~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (not (= 0 ~t2_st~0))) (.cse2 (and (not (= 1 ~E_3~0)) (and (and (= |old(~T2_E~0)| ~T2_E~0) (and (and (and (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0))))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))) (not (= 1 ~M_E~0))) (not (= ~T1_E~0 1)) (not (= 1 ~T2_E~0)) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))))) (.cse7 (not (= 0 ~t1_st~0))) (.cse9 (<= 2 ~E_2~0)) (.cse3 (<= 2 ~m_st~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (let ((.cse4 (+ ~local~0 2))) (and (<= .cse4 ~token~0) (and .cse5 .cse6 (= 1 ~t2_pc~0) .cse2 .cse7 .cse8 .cse9 .cse3) (<= ~token~0 .cse4))) (and .cse2 .cse3 .cse10) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (and .cse0 (not .cse5) .cse1 .cse2 .cse11 .cse10) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (= 0 |old(~E_3~0)|) (and .cse5 .cse6 .cse1 .cse2 .cse7 .cse8 .cse9 .cse3) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_2~0)|)) (and .cse0 .cse5 .cse6 .cse2 .cse7 .cse9 .cse3) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:25:30,756 INFO L439 ceAbstractionStarter]: At program point L706(lines 653 711) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~t2_pc~0)| 0)) (not (= ~M_E~0 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T3_E~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~t3_pc~0)|) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_3~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_3~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 0 |old(~E_1~0)|) (not (<= 2 |old(~E_2~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:25:30,756 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:25:30,757 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~T1_E~0 1)) (not (= 1 ~t1_pc~0)) (not (= 1 ~t3_pc~0)) (not (= ~T3_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (<= ~t2_pc~0 0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not (= ~T1_E~0 0)) (not (= 1 ~T2_E~0)) (not (= 1 ~E_3~0)) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (not (= ~E_3~0 0)) (not (= ~E_1~0 0)) (not (= 1 ~M_E~0)) (<= ~local~0 ~token~0) (not (= ~E_M~0 1))) [2019-10-02 16:25:30,757 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:25:30,757 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:25:30,757 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 622 633) no Hoare annotation was computed. [2019-10-02 16:25:30,757 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 622 633) no Hoare annotation was computed. [2019-10-02 16:25:30,757 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 622 633) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (not (<= ~t2_pc~0 0)) (not (<= ~token~0 ~local~0)) (= ~T3_E~0 1) (= ~T2_E~0 0) (= 1 ~t3_pc~0) (not (= ~t1_i~0 1)) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= ~t1_st~0 0)) (= 1 ~E_3~0) (= 1 ~E_1~0) (= 0 ~E_3~0) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 0 ~E_1~0) (not (<= 2 ~E_2~0)) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2019-10-02 16:25:30,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:25:30 BoogieIcfgContainer [2019-10-02 16:25:30,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:25:30,997 INFO L168 Benchmark]: Toolchain (without parser) took 341135.85 ms. Allocated memory was 136.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 85.4 MB in the beginning and 440.6 MB in the end (delta: -355.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-02 16:25:30,998 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 136.3 MB. Free memory is still 103.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 16:25:30,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.21 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 85.0 MB in the beginning and 174.4 MB in the end (delta: -89.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-02 16:25:30,999 INFO L168 Benchmark]: Boogie Preprocessor took 52.49 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 171.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-02 16:25:30,999 INFO L168 Benchmark]: RCFGBuilder took 799.27 ms. Allocated memory is still 200.3 MB. Free memory was 171.7 MB in the beginning and 128.6 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:25:31,000 INFO L168 Benchmark]: TraceAbstraction took 339758.70 ms. Allocated memory was 200.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 128.6 MB in the beginning and 440.6 MB in the end (delta: -312.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-02 16:25:31,003 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.53 ms. Allocated memory is still 136.3 MB. Free memory is still 103.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 520.21 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 85.0 MB in the beginning and 174.4 MB in the end (delta: -89.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.49 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 171.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.27 ms. Allocated memory is still 200.3 MB. Free memory was 171.7 MB in the beginning and 128.6 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 339758.70 ms. Allocated memory was 200.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 128.6 MB in the beginning and 440.6 MB in the end (delta: -312.0 MB). Peak memory consumption was 2.0 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: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(1 == t3_pc)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || (((m_st == 0 && E_3 == \old(E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st))) && ((((!(1 == \old(t2_pc)) || ((((((2 <= m_st && \old(token) == token) && E_3 == \old(E_3)) && \old(t2_st) == t2_st) && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st)) || !(local + 1 <= \old(token))) || !(\old(token) <= local + 1)) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || (((2 <= m_st && E_3 == \old(E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((2 <= m_st && E_3 == \old(E_3)) || T1_E == 0) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (!(\old(t2_pc) <= 0) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || 0 == \old(E_3)) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (!(\old(t2_pc) <= 0) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || (((m_st == 0 && E_3 == \old(E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && E_3 == \old(E_3)) && \old(t2_st) == t2_st) && 1 == t2_pc) && \old(t1_st) == t1_st)) || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || ((((2 <= m_st && E_3 == \old(E_3)) && \old(t2_st) == t2_st) && 1 == t2_pc) && \old(t1_st) == t1_st))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || ((((2 <= m_st && \old(t2_st) == t2_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || ((((2 <= m_st && \old(t2_st) == t2_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 1 == \old(m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((((2 <= m_st && token <= local) && \old(t2_st) == t2_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) && local <= token)) || 0 == E_3) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((2 <= m_st && \old(t2_st) == t2_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || (((((((2 <= m_st && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) && local <= token)) || (((((2 <= m_st && \old(t2_st) == t2_st) && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == E_3) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= \old(local))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((2 <= m_st && \old(t2_st) == t2_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == E_3) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || ((((((2 <= m_st && token <= local) && \old(t2_st) == t2_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) && local <= token)) || 1 == E_M) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((((2 <= m_st && !(1 == T2_E)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || !(\old(token) <= \old(local))) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || (((((((((((((!(T2_E == 0) && !(M_E == 0)) && 2 <= m_st) && !(1 == T2_E)) && !(1 == E_3)) && !(1 == M_E)) && \old(t2_st) == t2_st) && !(T3_E == 1)) && 2 <= t3_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(\old(local) <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || ((((2 <= m_st && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || ((((2 <= m_st && 2 <= t3_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 1 == \old(m_pc))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((((2 <= m_st && !(1 == T2_E)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) <= \old(local) + 3)) || 1 == E_3) || 1 == \old(E_1)) || (((((((((((((!(T2_E == 0) && !(M_E == 0)) && 2 <= m_st) && !(1 == T2_E)) && !(1 == E_3)) && !(1 == M_E)) && \old(t2_st) == t2_st) && !(T3_E == 1)) && 2 <= t3_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || !(\old(local) + 3 <= \old(token)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || (((((2 <= m_st && \old(t2_st) == t2_st) && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || ((((2 <= m_st && \old(t2_st) == t2_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || (((((2 <= m_st && \old(t2_st) == t2_st) && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((2 <= m_st && \old(t2_st) == t2_st) && 2 <= t3_st) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) || T1_E == 0) || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || (((((2 <= m_st && \old(t2_st) == t2_st) && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || ((((2 <= m_st && 2 <= t3_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || ((((2 <= m_st && \old(t2_st) == t2_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) && ((((((((((((!(token <= local) || !(t1_pc == 1)) || !(local <= token)) || 0 == t2_st) || !(2 <= t3_st)) || !(1 == t3_pc)) || __retres1 == 0) || !(1 == t2_pc)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && (((((((((((!(1 == t2_pc) || !(1 == E_1)) || 1 == E_3) || !(t1_pc == 1)) || __retres1 == 0) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= t3_st)) || !(1 == t3_pc)) || t1_st == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || __retres1 == 0)) && ((((((((((((!(token <= local) || !(t1_pc == 1)) || !(local <= token)) || 0 == t2_st) || __retres1 == 0) || 1 == t3_pc) || !(1 == t2_pc)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((!(t2_pc <= 0) || !(token <= local)) || !(local <= token)) || 1 == t3_pc) || !(t1_st == 0)) || __retres1 == 0) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || __retres1 == 0) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= t3_st)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || __retres1 == 0) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || !(t1_pc == 1)) || ((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= m_st)) || !(1 == t3_pc)) || t1_st == 0) || __retres1 == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || !(local + 2 <= token))) && ((((((((((!(t2_pc <= 0) || 0 == t2_st) || !(2 <= t3_st)) || !(t1_st == 0)) || !(1 == E_1)) || 1 == E_3) || __retres1 == 0) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(t1_pc == 1)) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || !(2 <= t3_st)) || t1_st == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(t1_pc == 1)) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || t1_st == 0) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || __retres1 == 0) || !(2 <= t3_st)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && (!(t2_pc <= 0) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || __retres1 == 0) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || __retres1 == 0)) && ((((((((((!(1 == E_1) || 1 == E_3) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || 1 == t3_pc) || __retres1 == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && (((((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && (((((((((((!(1 == t2_pc) || __retres1 == 0) || !(1 == E_1)) || 1 == E_3) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= t3_st)) || !(1 == t3_pc)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0))) && (((((((((((!(t2_pc <= 0) || !(token <= local)) || !(local <= token)) || !(2 <= t3_st)) || !(t1_st == 0)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || __retres1 == 0)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 0) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((__retres1 == 0 || !(1 == E_1)) || 1 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= t3_st)) || t1_st == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || !(t2_pc <= 0))) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || __retres1 == 0) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || ((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= m_st)) || !(1 == t3_pc)) || !(t1_st == 0))) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || t1_st == 0) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((((__retres1 == 0 || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t3_pc)) || !(token <= local + 3)) || !(1 == t2_pc)) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || ((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t1_i)) || !(2 <= E_2)) || t1_st == 0) || !(local + 3 <= token))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= m_st && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && !(m_pc == 1)) || \old(T1_E) == 0) || \old(T2_E) == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= \old(local))) || (((\old(t3_pc) == t3_pc && 2 <= t3_st) && 2 <= m_st) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1))) || (((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && local + 2 <= token) && token <= local + 2)) || \old(T3_E) == 1) || \old(T2_E) == 0) || 1 == \old(t3_pc)) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t2_st)) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1))) || !(1 == t1_i)) || ((((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(token) == token) && \old(t1_st) == t1_st) && token <= local) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && local <= token) && \old(E_2) <= E_2)) || (((((\old(t3_pc) == t3_pc && 2 <= t3_st) && !(0 == t1_st)) && m_st == 0) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_3)) || !(\old(local) <= \old(token))) || (((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= t3_st) && m_st == 0) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || ((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1)) && \old(E_2) <= E_2)) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || (((((((1 == t1_pc && !(0 == t2_st)) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && !(1 == E_3) && ((((((\old(T2_E) == T2_E && (((!(E_1 == 0) && !(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(T1_E == 1)) && !(1 == T2_E)) && !(T3_E == 1)) && \old(T1_E) == T1_E) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(m_pc) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(local + 1 <= \old(token))) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || (((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(token) == token) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_M == 1))) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || ((((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || t1_pc == 1) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || ((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token) || T1_E == 0) || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == \old(E_M)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(\old(token) <= local + 2)) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || ((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || !(local + 2 <= \old(token)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_M == 1))) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(token) <= local)) || !(local <= \old(token))) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || !(local + 1 <= \old(token))) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((1 == t3_pc && 2 <= m_st) && \old(t2_st) == t2_st) && token <= local + 2) && \old(t1_st) == t1_st) && local + 2 <= token) && E_M == \old(E_M))) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(\old(token) <= local + 2)) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || !(local + 2 <= \old(token)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((2 <= m_st && E_M == \old(E_M)) || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(\old(token) <= local)) || !(local <= \old(token))) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 0 == __retres1) || t1_st == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || T3_E == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(local <= token)) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || 0 == __retres1) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((!(1 == t2_pc) || !(local + 1 <= token)) || 0 == __retres1) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || !(token <= local + 1))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || 0 == __retres1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(token <= local + 3)) || 1 == E_3) || 1 == E_1) || 1 == E_M) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 0 == __retres1) || !(local + 3 <= token))) && ((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(1 == t1_i)) || t1_st == 0) || 0 == __retres1) || 0 == E_3) || !(t1_pc == 1)) || !(local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || !(local + 2 <= token))) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || 0 == __retres1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == t2_st) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || !(local + 2 <= token))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || 0 == __retres1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(local <= token)) || !(2 <= t3_st)) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((!(1 == t2_pc) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || !(local + 1 <= token)) || !(token <= local + 1)) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || 0 == __retres1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || 0 == E_3) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 0 == __retres1) || !(local + 2 <= token))) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == __retres1) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((!(1 == t2_pc) || !(1 == E_1)) || 1 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= t3_st)) || !(1 == t3_pc)) || t1_st == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 0) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || __retres1 == 0) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || !(local + 1 <= token)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 <= m_st)) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((1 == E_3 || 1 == E_1) || __retres1 == 0) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 <= m_st)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || __retres1 == 0)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || __retres1 == 0) || !(t1_pc == 1)) || !(1 == t1_i)) || !(2 <= E_2)) || t1_st == 0) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((__retres1 == 0 || !(t2_pc <= 0)) || 0 == t2_st) || !(2 <= t3_st)) || !(t1_st == 0)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || __retres1 == 0) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((__retres1 == 0 || !(token <= local)) || !(local <= token)) || 0 == t2_st) || !(2 <= t3_st)) || !(1 == t3_pc)) || !(t1_st == 0)) || !(1 == t2_pc)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E)) && (((((((((((!(1 == t2_pc) || __retres1 == 0) || !(1 == E_1)) || 1 == E_3) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= t3_st)) || !(1 == t3_pc)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0))) && ((((((((((!(1 == E_1) || 1 == E_3) || __retres1 == 0) || !(t2_pc <= 0)) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((!(1 == E_1) || __retres1 == 0) || 1 == E_3) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((((!(1 == E_1) || 1 == E_3) || __retres1 == 0) || !(2 <= t3_st)) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || __retres1 == 0) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= t3_st)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || __retres1 == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || __retres1 == 0) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || __retres1 == 0) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || !(local + 1 <= token)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(t1_pc == 1)) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= t3_st)) || t1_st == 0) || __retres1 == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || __retres1 == 0) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= t3_st)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) || !(t1_st == 0))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || __retres1 == 0) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && (((((((((((((!(t1_pc == 1) || 0 == t2_st) || !(1 == t3_pc)) || __retres1 == 0) || !(token <= local + 3)) || !(1 == t2_pc)) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t1_i)) || !(2 <= E_2)) || t1_st == 0) || !(local + 3 <= token))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || __retres1 == 0) || 1 == m_pc)) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_pc == 1) || !(2 <= m_st)) || !(1 == t3_pc)) || !(t1_st == 0))) && ((((((((((!(1 == E_1) || 1 == E_3) || __retres1 == 0) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= t3_st)) || t1_st == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((!(t2_pc <= 0) || !(token <= local)) || !(local <= token)) || !(2 <= t3_st)) || !(t1_st == 0)) || !(1 == E_1)) || 1 == E_3) || __retres1 == 0) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t2_pc <= 0)) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || 1 == t3_pc) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || !(token <= local + 2)) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || __retres1 == 0) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || __retres1 == 0) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((__retres1 == 0 || !(token <= local)) || !(local <= token)) || 0 == t2_st) || 1 == t3_pc) || !(t1_st == 0)) || !(1 == t2_pc)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((!(1 == E_1) || 1 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || t1_st == 0) || 1 == t3_pc) || __retres1 == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc)) && ((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || !(t1_pc == 1)) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= m_st)) || !(1 == t3_pc)) || t1_st == 0) || __retres1 == 0)) && ((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((!(t2_pc <= 0) || !(token <= local)) || !(local <= token)) || 1 == t3_pc) || !(t1_st == 0)) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == m_pc) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || (((((((1 == t1_pc && m_st == 0) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st)) && local <= token) && \old(E_2) <= E_2)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((((((1 == t1_pc && 2 <= m_st) && !(1 == T2_E)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st)) && !(T1_E == 0)) && !(E_3 == 0))) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || ((((1 == t1_pc && m_st == 0) && \old(t2_st) == t2_st) && !(0 == t1_st)) && \old(E_2) <= E_2)) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc) || ((((((1 == t1_pc && m_st == 0) && token <= local) && \old(t2_st) == t2_st) && !(0 == t1_st)) && local <= token) && \old(E_2) <= E_2))) && ((((((!(1 == t2_pc) || ((((((1 == t1_pc && 2 <= m_st) && token <= \old(token) + 1) && 2 <= E_2) && 2 <= t3_st) && !(0 == t1_st)) && local + 1 <= token)) || !(\old(token) <= local)) || !(local <= \old(token))) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || (((((1 == t1_pc && 2 <= m_st) && 2 <= E_2) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st))) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((!(t2_pc <= 0) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || (((((((1 == t1_pc && m_st == 0) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st)) && local <= token) && \old(E_2) <= E_2)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || (((((1 == t1_pc && m_st == 0) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st)) && \old(E_2) <= E_2)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || ((((1 == t1_pc && m_st == 0) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st))) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || ((((1 == t1_pc && 2 <= m_st) && 2 <= E_2) && \old(t2_st) == t2_st) && !(0 == t1_st))) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((!(1 == t2_pc) || !(\old(token) <= local)) || (((((1 == t1_pc && 2 <= m_st) && token <= \old(token) + 1) && 2 <= E_2) && !(0 == t1_st)) && local + 1 <= token)) || !(local <= \old(token))) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || ((((1 == t1_pc && 2 <= m_st) && 2 <= E_2) && \old(t2_st) == t2_st) && !(0 == t1_st))) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((((((((1 == t1_pc && 2 <= m_st) && 2 <= E_2) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st)) || T1_E == 0) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((!(t2_pc <= 0) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((((((1 == t1_pc && 2 <= m_st) && !(1 == T2_E)) && !(E_2 == 0)) && 2 <= t3_st) && !(0 == t1_st)) && !(T1_E == 0)) && !(E_3 == 0))) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || ((((1 == t1_pc && 2 <= m_st) && \old(t2_st) == t2_st) && !(0 == t1_st)) && \old(E_2) <= E_2)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((\old(t2_st) == t2_st && !(0 == t1_st)) && \old(E_2) <= E_2)) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || (((((1 == t1_pc && 2 <= m_st) && \old(t2_st) == t2_st) && 2 <= t3_st) && !(0 == t1_st)) && \old(E_2) <= E_2)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || ((((((1 == t1_pc && m_st == 0) && token <= local) && \old(t2_st) == t2_st) && !(0 == t1_st)) && local <= token) && \old(E_2) <= E_2)) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || (((\old(t2_st) == t2_st && 2 <= t3_st) && !(0 == t1_st)) && \old(E_2) <= E_2)) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || ((((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && ((((!(1 == t2_pc) || ((((((1 == t1_pc && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && local <= token)) || !(\old(token) <= local)) || !(local <= \old(token))) || (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || \old(t1_pc) == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || 1 == m_pc)) && ((((!(1 == t2_pc) || !(\old(token) <= local)) || !(local <= \old(token))) || (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || (((((((1 == t1_pc && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token))) && (((((((((((((((((((T1_E == 0 || (((((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st)) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st)) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || (((((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || !(1 == t1_i)) || 0 == E_3) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == \old(E_M)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || t1_pc == 1) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || (((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(local + 1 <= \old(token))) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || ((((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(token) == token) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || !(\old(token) <= local + 1)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || (((((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || (((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || (((((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_M == 1))) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && ((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(token) <= local)) || (((((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_M == 1))) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || (((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st))) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || (((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || (((((\old(t3_pc) == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == \old(E_M)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || (((((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || (((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || 1 == m_pc)) && (((((((((((((((((((((((((T1_E == 0 || ((((2 <= m_st && !(E_M == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_M == 1))) || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || (((((1 == t3_pc && 2 <= m_st) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st)) || 0 == E_3) || !(\old(token) <= local + 2)) || !(t1_pc == 1)) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == t2_pc)) || T1_E == 1) || (((((((1 == t3_pc && m_st == 0) && !(E_M == 0)) && \old(t2_st) == t2_st) && !(E_M == 1)) && token <= local + 3) && \old(token) + 1 <= token) && \old(t1_st) == t1_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || !(local + 2 <= \old(token)))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= \old(token))) || t1_pc == 1) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == \old(E_M)) || (((((((\old(t3_pc) == t3_pc && m_st == 0) && !(E_M == 0)) && token <= local) && \old(t2_st) == t2_st) && !(E_M == 1)) && \old(t1_st) == t1_st) && local <= token)) || 1 == m_pc) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((((((1 == t1_pc && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || \old(t1_st) == 0) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= \old(local))) || T3_E == 1) || (((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && local + 2 <= token) && token <= local + 2)) || T2_E == 0) || 1 == \old(t3_pc)) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t2_st)) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st)) || 0 == \old(E_3)) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || (((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_1)) || (((((((((1 == t1_pc && !(0 == t2_st)) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == \old(E_3)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_2)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && !(0 == t1_st)) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_3)) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= t3_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1))) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == \old(t3_pc))) || T2_E == 0) || (((((((1 == t1_pc && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || \old(t1_st) == t1_st) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == \old(E_3)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && \old(t1_st) == t1_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(m_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((!(0 == t2_st) && 2 <= E_2) && (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc))) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(\old(token) <= \old(local) + 2)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || !(\old(local) + 2 <= \old(token))) || ((((!(0 == t2_st) && 2 <= E_2) && ((((1 == t1_pc && 1 == t2_pc) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && local + 2 <= token) && token <= local + 2))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 1 == t2_pc) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M))) && ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t2_st)) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st)) || 0 == \old(E_3)) || \old(t1_pc) == 1) || (((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t2_st)) && 1 == t2_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || (((((((((1 == t1_pc && !(0 == t2_st)) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st)) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(2 <= \old(t3_st))) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || ((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc))) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((m_st == 0 && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((((((T1_E == 0 || (((((((m_st == 0 && !(1 == E_3)) && token <= local) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((!(\old(t2_pc) <= 0) || ((((((2 <= m_st && !(1 == E_3)) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0))) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || ((((2 <= m_st && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || 0 == E_M) || 0 == E_2)) && ((((((!(1 == \old(t2_pc)) || !(local + 1 <= \old(token))) || ((((((2 <= m_st && !(1 == E_3)) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0))) || !(\old(token) <= local + 1)) || (((((((2 <= m_st && !(1 == E_3)) && token <= local + 2) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local + 2 <= token)) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || ((((((((2 <= m_st && !(1 == E_3)) && token <= local) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || ((((m_st == 0 && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == M_E) || 1 == E_M) || (((((2 <= m_st && !(1 == E_3)) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0))) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || ((((((((m_st == 0 && !(1 == E_3)) && token <= local) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || ((((((((m_st == 0 && !(1 == E_3)) && token <= local) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || (((((2 <= m_st && !(1 == E_3)) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)))) && (((((((((2 <= m_st && !(1 == E_3)) && 1 == t2_pc) && 2 <= t3_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) || !(\old(t2_pc) <= 0)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((2 <= m_st && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || (((((((m_st == 0 && !(1 == E_3)) && token <= local) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_3)) || (((((((2 <= m_st && !(1 == E_3)) && token <= local) && 1 == t2_pc) && !(0 == t2_st)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == E_M) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(t2_pc) <= 0) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 1 == t3_pc) && !(1 == T2_E)) && !(1 == E_3)) && 2 <= E_2) && !(1 == M_E)) && \old(t2_st) == t2_st) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && 2 <= t3_st) && !(0 == t1_st)) && t1_i == 1) && !(E_1 == 1)) && !(0 == t2_st)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && !(E_1 == 0))) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((m_st == 0 && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((!(1 == \old(t2_pc)) || !(local + 1 <= \old(token))) || (((((((2 <= m_st && !(1 == E_3)) && \old(t2_st) == t2_st) && token <= local + 2) && 1 == t2_pc) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local + 2 <= token)) || !(\old(token) <= local + 1)) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || ((((((((((((((((((((((1 == t1_pc && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 1 == t3_pc) && !(1 == T2_E)) && !(1 == E_3)) && 2 <= E_2) && !(1 == M_E)) && \old(t2_st) == t2_st) && !(E_M == 1)) && !(T1_E == 1)) && !(T3_E == 1)) && 2 <= t3_st) && !(0 == t1_st)) && t1_i == 1) && !(E_1 == 1)) && !(0 == t2_st)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && !(E_1 == 0))) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || ((((2 <= m_st && !(1 == E_3)) && \old(t1_st) == t1_st) && !(E_3 == 0)) && \old(t2_st) == t2_st)) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || ((((2 <= m_st && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || ((((m_st == 0 && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || ((((2 <= m_st && !(1 == E_3)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || ((((((((m_st == 0 && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || ((((((((m_st == 0 && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || ((((((((2 <= m_st && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || 0 == \old(E_3)) || !(t1_pc == 1)) || !(local <= \old(token))) || 1 == E_M) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || (((((((2 <= m_st && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((2 <= m_st && !(1 == E_3)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0))) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((2 <= m_st && !(1 == E_3)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) || !(\old(t2_pc) <= 0)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || ((((((((((((((((!(1 == t1_pc) && !(T1_E == 1)) && !(T3_E == 1)) && !(T2_E == 0)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_3 == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == \old(E_3)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(local <= \old(token))) || !(t1_pc == 1)) || (((((((m_st == 0 && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == E_1) || !(1 == t1_i)) || (((((((m_st == 0 && t2_pc <= 0) && !(1 == E_3)) && token <= local) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && !(E_3 == 0)) && local <= token)) || 0 == \old(E_3)) || !(local <= \old(token))) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(\old(t2_pc) <= 0)) || !(M_E == 0)) || !(\old(token) <= \old(local))) || \old(T3_E) == 1) || \old(T2_E) == 0) || 1 == \old(t3_pc)) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_3)) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(\old(local) <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) <= \old(local) + 3)) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((\old(token) == token && local + 3 <= token) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && 2 <= t3_st) && token <= local + 3) && \old(t1_st) == t1_st)) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || !(\old(local) + 3 <= \old(token)))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T3_E == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || __retres1 == 0) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc) || __retres1 == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((!(t1_pc == 1) || 0 == t2_st) || !(1 == t3_pc)) || __retres1 == 0) || !(token <= local + 3)) || !(1 == t2_pc)) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t1_i)) || !(2 <= E_2)) || t1_st == 0) || !(local + 3 <= token))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || __retres1 == 0) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && ((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 0) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || !(local + 2 <= token))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || __retres1 == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || !(t1_pc == 1)) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || !(2 <= m_st)) || !(1 == t3_pc)) || t1_st == 0) || __retres1 == 0)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(2 <= m_st)) || !(2 <= t3_st)) || __retres1 == 0) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2)) && (((((__retres1 == 0 || 1 == E_3) || 1 == E_1) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(2 <= m_st)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || __retres1 == 0) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 0) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(token <= local + 2)) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || __retres1 == 0) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || !(local + 2 <= token))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || __retres1 == 0) || !(2 <= t3_st)) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((!(1 == t2_pc) || !(local + 1 <= token)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || !(token <= local + 1)) || __retres1 == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || t1_pc == 1) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 1 == E_3) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((!(1 == t2_pc) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || !(local + 1 <= token)) || __retres1 == 0) || !(token <= local + 1))) && (((((((((((!(1 == t2_pc) || 1 == E_3) || 1 == E_1) || (((((((((T1_E == 1 || T1_E == 0) || T2_E == 1) || 0 == E_3) || 0 == E_1) || 0 == E_M) || 0 == E_2) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 0 == t2_st) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 0) || t1_pc == 1) || !(2 <= m_st)) || !(1 == t3_pc)) || !(t1_st == 0))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || __retres1 == 0) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || __retres1 == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(t1_pc == 1)) || 0 == t2_st) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 0) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || __retres1 == 0) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || __retres1 == 0) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= \old(local))) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || (((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || (((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || (((!(m_pc == 1) && E_1 == \old(E_1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || ((((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(token) <= \old(local) + 3)) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || ((((((\old(token) == token && local + 3 <= token) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && 2 <= t3_st) && token <= local + 3) && \old(t1_st) == t1_st)) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || !(\old(local) + 3 <= \old(token)))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || ((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && local <= token)) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(\old(local) <= \old(token))) || !(t1_pc == 1)) || !(2 <= \old(t3_st))) || (((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || ((((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || t1_pc == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || (((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || ((((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == \old(E_1)) || !(2 <= E_2)) || 0 == E_M) || ((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || (((!(m_pc == 1) && E_1 == \old(E_1)) && \old(t2_st) == t2_st) && \old(t1_st) == t1_st)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || \old(t1_st) == 0) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == \old(E_1)) || (((!(m_pc == 1) && E_1 == \old(E_1)) && 2 <= t3_st) && \old(t1_st) == t1_st)) || 0 == \old(E_1)) || 0 == E_M) || 0 == E_2) || \old(t1_st) == 0) || 1 == \old(m_pc)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(local <= token)) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || __retres1 == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 1) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(token <= local + 3)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(1 == t3_pc)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || !(local + 3 <= token))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || __retres1 == 1) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == t2_st) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || __retres1 == 1) || t1_pc == 1) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || t1_pc == 1) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || __retres1 == 1) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == t2_st) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || __retres1 == 1) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(local <= token)) || !(t1_pc == 1)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || T3_E == 1) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(local <= token)) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || __retres1 == 1) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || !(0 == t2_st)) || T2_E == 1) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(local + 1 <= token)) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || !(token <= local + 1)) || 0 == E_M) || __retres1 == 1)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(token <= local)) || __retres1 == 1) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || t1_pc == 1) || !(2 <= t3_st)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(local <= token)) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(token <= local)) || !(local <= token)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || __retres1 == 1) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == t2_st) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || T3_E == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(0 == t2_st)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || !(t1_pc == 1)) || !(0 == t2_st)) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) || t1_st == 0) || __retres1 == 1)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || !(2 <= m_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || !(local + 1 <= token)) || 1 == E_1) || !(1 == t1_i)) || t1_st == 0) || 0 == E_3) || !(t1_pc == 1)) || !(2 <= t3_st)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || __retres1 == 1) || 0 == E_1) || !(0 == t2_st)) || !(2 <= E_2)) || !(token <= local + 1)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 1) || !(token <= local)) || 0 == t2_st) || T3_E == 1) || !(2 <= m_st)) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || 0 == E_3) || !(local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == E_1) || !(2 <= E_2)) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || t1_pc == 1) || !(2 <= m_st)) || !(2 <= t3_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= E_2)) || 0 == E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= m_st) && ((!(T1_E == 0) && !(1 == T2_E)) && !(E_3 == 0)) && !(E_2 == 0))) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || ((((((2 <= t3_st && m_st == 0) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || (((\old(t1_st) == t1_st && 2 <= m_st) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((!(1 == t2_pc) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || ((((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= E_2) && 2 <= m_st) && \old(t2_st) == t2_st)) || !(\old(token) <= local)) || (((((2 <= t3_st && 2 <= m_st) && token <= \old(token) + 1) && \old(t1_st) == t1_st) && 2 <= E_2) && local + 1 <= token)) || !(local <= \old(token))) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && (((2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) || !(t2_pc <= 0)) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || 0 == \old(t2_st)) || ((((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= m_st) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) || (((\old(t1_st) == t1_st && 2 <= E_2) && 2 <= m_st) && \old(t2_st) == t2_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || (((m_st == 0 && \old(t1_st) == t1_st) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= E_2) && 2 <= m_st) && \old(t2_st) == t2_st)) || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || 1 == m_pc)) && ((((((!(1 == t2_pc) || (2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || (((\old(t1_st) == t1_st && 2 <= E_2) && 2 <= m_st) && \old(t2_st) == t2_st)) || !(\old(token) <= local)) || ((((2 <= m_st && token <= \old(token) + 1) && \old(t1_st) == t1_st) && 2 <= E_2) && local + 1 <= token)) || !(local <= \old(token))) || ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || ((((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= m_st) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || ((((((2 <= t3_st && m_st == 0) && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || ((((2 <= t3_st && m_st == 0) && \old(t1_st) == t1_st) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((2 <= t3_st && \old(t1_st) == t1_st) && m_st == 0) && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || (((2 <= t3_st && \old(t1_st) == t1_st) && 2 <= m_st) && ((!(T1_E == 0) && !(1 == T2_E)) && !(E_3 == 0)) && !(E_2 == 0))) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || 0 == E_3) || ((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 1 == t3_pc) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || 0 == \old(t2_st)) || T3_E == 1) || (((((m_st == 0 && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t2_pc <= 0)) || !(\old(token) <= local)) || T3_E == 1) || T2_E == 0) || 1 == t3_pc) || 0 == M_E) || 1 == M_E) || 1 == E_3) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == E_3) || !(local <= \old(token))) || \old(t1_pc) == 1) || 1 == E_M) || (((((m_st == 0 && \old(t1_st) == t1_st) && token <= local) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == E_1) || !(2 <= \old(E_2))) || 0 == E_M) || 1 == m_pc)) && (((2 <= m_st && (((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(1 == T2_E)) && !(1 == E_3)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) || !(t2_pc <= 0)) || (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == E_3) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_3) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == E_M) || \old(t1_st) == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || \old(t1_st) == 0) || ((((((((1 == t1_pc && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || T3_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == \old(E_3)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((((((((((((((((((1 == t1_pc && 2 <= t3_st) && \old(t1_st) == t1_st) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && \old(t2_st) == t2_st) && \old(E_2) <= E_2) || T1_E == 0) || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || !(1 == \old(t3_pc))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || \old(t1_st) == 0)) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && 2 <= t3_st) && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_2)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && !(0 == t1_st)) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_3)) || \old(t1_pc) == 1) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= t3_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1))) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || (((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) || (((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) && !(tmp == 0))) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || !(2 <= \old(t3_st))) || !(1 == \old(t3_pc))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((local + 3 <= token && (!(0 == t2_st) && 2 <= E_2) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && token <= local + 3)) || 1 == \old(E_3)) || ((!(0 == t2_st) && 2 <= E_2) && ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) || (((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) && !(tmp == 0))))) || 1 == \old(E_1)) || !(1 == t1_i)) || (((1 == t2_pc && (!(0 == t2_st) && 2 <= E_2) && (((((1 == t1_pc && \old(t1_st) == t1_st) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) || (((((1 == t1_pc && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)))) && local + 2 <= token) && token <= local + 2)) || \old(t1_st) == 0) || 0 == \old(E_3)) || ((((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && token <= local) && local <= token)) || !(\old(token) <= \old(local) + 2)) || !(\old(t1_pc) == 1)) || !(1 == \old(t3_pc))) || (((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && ((((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && \old(t1_st) == t1_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) || (((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 1 == \old(t3_pc)) && !(tmp == 0))))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || !(\old(local) + 2 <= \old(token)))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(t2_st)) || T3_E == 1) || 1 == t2_pc) || !(2 <= \old(m_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || !(1 == t1_i)) || \old(t1_st) == 0) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(2 <= \old(E_2))) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || !(2 <= \old(t3_st))) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || \old(t1_st) == t1_st) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t2_pc <= 0) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2) || T1_E == 0) || ((((((((((1 == t1_pc && !(0 == t2_st)) && 1 == t2_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= E_2) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && token <= local) && local <= token)) || ((token <= local + 1 && 2 <= E_2 && (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && local + 1 <= token)) || (((((((((\old(t3_pc) == t3_pc && !(0 == t2_st)) && 1 == t2_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && \old(E_2) <= E_2) && token <= local) && local <= token)) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((!(0 == t2_st) && 2 <= E_2) && (((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && \old(t2_st) == t2_st)) || 1 == \old(E_3)) || ((((1 == t2_pc && token <= local) && ((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && m_st == 0) && !(m_pc == 1)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(E_2) <= E_2) && local <= token) && \old(token) == token)) || ((local + 3 <= token && token <= local + 3) && (!(0 == t2_st) && 2 <= E_2) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0))) || ((((((((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && t1_i == 1) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((((((((1 == t1_pc && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && t2_pc <= 0) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || (((token <= local && local <= token) && \old(token) == token) && (((((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && !(m_pc == 1)) && !(0 == t2_st)) && 2 <= E_2) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1)) || ((((!(0 == t2_st) && (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && \old(t1_st) == t1_st) && m_st == 0) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1)) && t2_pc <= 0) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((!(0 == t2_st) && 2 <= E_2) && local + 2 <= token) && (((((1 == t1_pc && 1 == t2_pc) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && token <= local + 2)) || (((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && t2_pc <= 0) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((!(0 == t2_st) && 2 <= E_2) && (((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 1 == t2_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0))) || !(\old(local) <= \old(token))) || ((((((((((2 <= t3_st && 1 == t3_pc) && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && token <= local) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || ((token <= local + 1 && 2 <= E_2 && (((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 1 == t2_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && local + 1 <= token)) || (((((((((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(token) == token) && token <= local) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || (((!(0 == t2_st) && 2 <= E_2) && ((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && \old(t2_st) == t2_st)) || 0 == \old(E_1)) || (((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || (((2 <= E_2 && ((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && t2_pc <= 0) && \old(t2_st) == t2_st)) || 0 == \old(E_M)) || (((2 <= E_2 && (((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && t2_pc <= 0) && \old(t2_st) == t2_st)) || (((((((((1 == t2_pc && !(1 == t1_pc)) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(E_2) <= E_2)) || (((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= m_st) && 0 == t1_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T2_E == 1) || !(\old(t2_pc) <= 0)) || !(\old(token) <= \old(local))) || T3_E == 1) || T2_E == 0) || 1 == \old(t3_pc)) || ((((((((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && \old(t1_st) == t1_st) && m_st == 0) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1)) && token <= local) && t2_pc <= 0) && local <= token) && \old(t2_st) == t2_st) && \old(token) == token) && \old(E_2) <= E_2)) || 1 == \old(E_1)) || ((((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && m_st == 0) && 0 == t1_st) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || !(1 == t1_i)) || ((((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(0 == t1_st)) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(token) == token) && token <= local) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || (((((((((\old(t3_pc) == t3_pc && 2 <= m_st) && 0 == t1_st) && t2_pc <= 0) && token <= local) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((1 == t2_pc && token <= local) && (!(0 == t2_st) && (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && \old(t1_st) == t1_st) && m_st == 0) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1)) && \old(E_2) <= E_2) && local <= token) && \old(token) == token)) || ((((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 1 == t2_pc) && !(0 == t1_st)) && m_st == 0) && !(m_pc == 1)) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(E_2) <= E_2) && token <= local) && local <= token) && \old(token) == token)) || 0 == \old(E_3)) || ((((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && m_st == 0) && t1_i == 1) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((!(0 == t2_st) && 2 <= E_2) && (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0))) || T1_E == 1) || !(0 == \old(m_st))) || (((((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && m_st == 0) && t2_pc <= 0) && !(m_pc == 1)) && \old(token) == token) && \old(t1_st) == t1_st) && token <= local) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && local <= token) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((((((\old(t3_pc) == t3_pc && 1 == t2_pc) && !(1 == t1_pc)) && 2 <= m_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(E_2) <= E_2)) || !(2 <= \old(E_2))) || ((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= m_st) && t2_pc <= 0) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_3)) || 1 == \old(E_1)) || 0 == \old(E_2)) || \old(t1_st) == 0) || 0 == \old(E_3)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 2 <= t3_st) && \old(t1_st) == t1_st) && m_st == 0) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || !(2 <= \old(t3_st))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= t3_st) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st)) || 1 == \old(m_pc))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == \old(E_3)) || !(\old(t1_pc) == 1)) || T3_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_3)) || 1 == \old(E_1)) || (((1 == t1_pc && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((((((((((((T1_E == 0 || (((((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && 2 <= m_st) && 0 == t1_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || T2_E == 1) || !(\old(t2_pc) <= 0)) || 0 == \old(t2_st)) || T3_E == 1) || 1 == \old(t3_pc)) || T2_E == 0) || ((2 <= m_st && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(m_pc == 1))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((!(0 == t2_st) && 2 <= E_2) && (((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && \old(t2_st) == t2_st)) || 1 == \old(E_3)) || 1 == \old(E_1)) || ((((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && m_st == 0) && 0 == t1_st) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || !(1 == t1_i)) || ((((((((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && m_st == 0) && t1_i == 1) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((((((((1 == t1_pc && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && t2_pc <= 0) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((((!(0 == t2_st) && (((((((\old(t3_pc) == t3_pc && !(1 == t1_pc)) && !(1 == t3_pc)) && \old(t1_st) == t1_st) && m_st == 0) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t1_st) && !(m_pc == 1)) && t2_pc <= 0) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || 0 == \old(E_3)) || (((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && t2_pc <= 0) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || ((!(0 == t2_st) && 2 <= E_2) && (((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && 1 == t2_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0))) || ((((((((((((\old(t3_pc) == t3_pc && 1 == t1_pc) && !(1 == t3_pc)) && !(0 == t1_st)) && m_st == 0) && t1_i == 1) && t2_pc <= 0) && !(m_pc == 1)) && !(0 == t2_st)) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || ((!(0 == t2_st) && 2 <= E_2) && (((((((1 == t1_pc && 1 == t2_pc) && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((!(0 == t2_st) && 2 <= E_2) && ((((((1 == t1_pc && 2 <= t3_st) && !(0 == t1_st)) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(tmp == 0)) && \old(t2_st) == t2_st)) || 0 == \old(E_1)) || (((((((((((!(1 == t1_pc) && 2 <= t3_st) && 1 == t3_pc) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && !(0 == t2_st)) && \old(t1_st) == t1_st) && ((((((((((((!(T1_E == 1) && !(T3_E == 1)) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && !(1 == E_3)) && !(1 == T2_E)) && !(E_1 == 0)) && !(E_3 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_st) == t2_st) && \old(E_2) <= E_2)) || !(2 <= \old(E_2))) || 0 == \old(E_M)) || 1 == \old(m_pc)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 204 locations, 1 error locations. SAFE Result, 339.4s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 307.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 9124 SDtfs, 11563 SDslu, 12069 SDs, 0 SdLazy, 9020 SolverSat, 3322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2196 GetRequests, 2027 SyntacticMatches, 14 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12095occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 15185 PreInvPairs, 19190 NumberOfFragments, 115384 HoareAnnotationTreeSize, 15185 FomulaSimplifications, 15204811 FormulaSimplificationTreeSizeReduction, 22.3s HoareSimplificationTime, 80 FomulaSimplificationsInter, 5053531 FormulaSimplificationTreeSizeReductionInter, 284.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 6627 NumberOfCodeBlocks, 6627 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6591 ConstructedInterpolants, 0 QuantifiedInterpolants, 2115375 SizeOfPredicates, 6 NumberOfNonLiveVariables, 8377 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 3933/4044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...